The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Dan Olteanu: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Dan Olteanu, Tim Furche, François Bry
    Evaluating Complex Queries Against XML Streams with Polynomial Combined Complexity. [Citation Graph (0, 0)][DBLP]
    BNCOD, 2004, pp:31-44 [Conf]
  2. François Bry, Dan Olteanu, Sebastian Schaffert
    Towards Grouping Constructs for Semistructured Data. [Citation Graph (0, 0)][DBLP]
    DEXA Workshop, 2001, pp:66-70 [Conf]
  3. Dan Olteanu, Holger Meuss, Tim Furche, François Bry
    XPath: Looking Forward. [Citation Graph (0, 0)][DBLP]
    EDBT Workshops, 2002, pp:109-127 [Conf]
  4. François Bry, Fatih Coskun, Serap Durmaz, Tim Furche, Dan Olteanu, Markus Spannagel
    The XML Stream Query Processor SPEX. [Citation Graph (0, 0)][DBLP]
    ICDE, 2005, pp:1120-1121 [Conf]
  5. Dan Olteanu, Tobias Kiesling, François Bry
    An Evaluation of Regular Path Expressions with Qualifiers against XML Streams. [Citation Graph (0, 0)][DBLP]
    ICDE, 2003, pp:702-704 [Conf]
  6. Lyublena Antova, Christoph Koch, Dan Olteanu
    World-Set Decompositions: Expressiveness and Efficient Algorithms. [Citation Graph (0, 0)][DBLP]
    ICDT, 2007, pp:194-208 [Conf]
  7. Dan Olteanu
    Accelerating XPath Evaluation against XML Streams. [Citation Graph (0, 0)][DBLP]
    PLAN-X, 2006, pp:82- [Conf]
  8. Dan Olteanu, Tim Furche, François Bry
    An efficient single-pass query evaluator for XML data streams. [Citation Graph (0, 0)][DBLP]
    SAC, 2004, pp:627-631 [Conf]
  9. Ioana Manolescu, Daniela Florescu, Donald Kossmann, Florian Xhumari, Dan Olteanu
    Agora: Living with XML and Relational. [Citation Graph (0, 0)][DBLP]
    VLDB, 2000, pp:623-626 [Conf]
  10. François Bry, Tim Furche, Dan Olteanu
    Datenströme. [Citation Graph (0, 0)][DBLP]
    Informatik Spektrum, 2004, v:27, n:2, pp:168-171 [Journal]
  11. François Bry, Michael Kraus, Dan Olteanu, Sebastian Schaffert
    Semistrukturierte Daten - Aktuelles Schlagwort. [Citation Graph (0, 0)][DBLP]
    Informatik Spektrum, 2001, v:24, n:4, pp:230-233 [Journal]
  12. Dan Olteanu
    SPEX: Streamed and Progressive Evaluation of XPath. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Knowl. Data Eng., 2007, v:19, n:7, pp:934-949 [Journal]
  13. Lyublena Antova, Christoph Koch, Dan Olteanu
    MayBMS: Managing Incomplete Information with Probabilistic World-Set Decompositions. [Citation Graph (0, 0)][DBLP]
    ICDE, 2007, pp:1479-1480 [Conf]
  14. Lyublena Antova, Christoph Koch, Dan Olteanu
    10106 Worlds and Beyond: Efficient Representation and Processing of Incomplete Information. [Citation Graph (0, 0)][DBLP]
    ICDE, 2007, pp:606-615 [Conf]
  15. Lyublena Antova, Christoph Koch, Dan Olteanu
    From complete to incomplete information and back. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2007, pp:713-724 [Conf]
  16. Lyublena Antova, Christoph Koch, Dan Olteanu
    Query language support for incomplete information in the MayBMS system. [Citation Graph (0, 0)][DBLP]
    VLDB, 2007, pp:1422-1425 [Conf]
  17. Christoph Koch, Dan Olteanu, Stefanie Scherzinger
    Building a Native XML-DBMS as a Term Project in a Database Systems Course. [Citation Graph (0, 0)][DBLP]
    XIME-P, 2006, pp:- [Conf]
  18. Lyublena Antova, Christoph Koch, Dan Olteanu
    World-set Decompositions: Expressiveness and Efficient Algorithms [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  19. Lyublena Antova, Christoph Koch, Dan Olteanu
    10^(10^6) Worlds and Beyond: Efficient Representation and Processing of Incomplete Information [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  20. Lyublena Antova, Thomas Jansen, Christoph Koch, Dan Olteanu
    Fast and Simple Relational Processing of Uncertain Data [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  21. Dan Olteanu
    Forward node-selecting queries over trees. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Database Syst., 2007, v:32, n:1, pp:3- [Journal]

  22. Bridging the gap between intensional and extensional query evaluation in probabilistic databases. [Citation Graph (, )][DBLP]


  23. Fast and Simple Relational Processing of Uncertain Data. [Citation Graph (, )][DBLP]


  24. SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases. [Citation Graph (, )][DBLP]


  25. Approximate confidence computation in probabilistic databases. [Citation Graph (, )][DBLP]


  26. MayBMS: a probabilistic database management system. [Citation Graph (, )][DBLP]


  27. Secondary-storage confidence computation for conjunctive queries with inequalities. [Citation Graph (, )][DBLP]


  28. Using OBDDs for Efficient Query Evaluation on Probabilistic Databases. [Citation Graph (, )][DBLP]


  29. Conditioning Probabilistic Databases [Citation Graph (, )][DBLP]


Search in 0.606secs, Finished in 0.608secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002