Conferences in DBLP

International Conference on Database Theory (ICDT) (icdt)
2001 (conf/icdt/2001)

1. Leonid Libkin
   Expressive Power of SQL. [Citation Graph (0, 19)][DBLP]
   ICDT, 2001, pp:1-21 [Conf]
   
2. Jörg Flum, Markus Frick, Martin Grohe
   Query Evaluation via Tree-Decompositions. [Citation Graph (0, 14)][DBLP]
   ICDT, 2001, pp:22-38 [Conf]
   
3. Marcelo Arenas, Leopoldo E. Bertossi, Jan Chomicki
   Scalar Aggregation in FD-Inconsistent Databases. [Citation Graph (0, 10)][DBLP]
   ICDT, 2001, pp:39-53 [Conf]
   
4. Vitaliy L. Khizder, David Toman, Grant E. Weddell
   On Decidability and Complexity of Description Logics with Uniqueness Constraints. [Citation Graph (0, 17)][DBLP]
   ICDT, 2001, pp:54-67 [Conf]
   
5. James Bailey, Szabolcs Mikulás
   Expressiveness Issues and Decision Problems for Active Database Event Queries. [Citation Graph (0, 12)][DBLP]
   ICDT, 2001, pp:68-82 [Conf]
   
6. Seppo Sippu, Eljas Soisalon-Soininen
   A Theory of Transactions on Recoverable Search Trees. [Citation Graph (0, 16)][DBLP]
   ICDT, 2001, pp:83-98 [Conf]
   
7. Chen Li, Mayank Bawa, Jeffrey D. Ullman
   Minimizing View Sets without Losing Query-Answering Power. [Citation Graph (0, 21)][DBLP]
   ICDT, 2001, pp:99-113 [Conf]
   
8. Bo Xu, Ouri Wolfson, Sam Chamberlain
   Cost Based Data Dissemination in Broadcast Networks with Disconnection. [Citation Graph (0, 16)][DBLP]
   ICDT, 2001, pp:114-128 [Conf]
   
9. Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambrusch, Andrew Rau-Chaplin
   Parallelizing the Data Cube. [Citation Graph (0, 18)][DBLP]
   ICDT, 2001, pp:129-143 [Conf]
   
10. Rakesh K. Sinha, Randeep Bhatia, Chung-Min Chen
    Asymptotically Optimal Declustering Schemes for Range Queries. [Citation Graph (0, 15)][DBLP]
    ICDT, 2001, pp:144-158 [Conf]
    
11. Mirek Riedewald, Divyakant Agrawal, Amr El Abbadi
    Flexible Data Cubes for Online Aggregation. [Citation Graph (0, 17)][DBLP]
    ICDT, 2001, pp:159-173 [Conf]
    
12. Jeff Edmonds, Jarek Gryz, Dongming Liang, Renée J. Miller
    Mining for Empty Rectangles in Large Data Sets. [Citation Graph (0, 10)][DBLP]
    ICDT, 2001, pp:174-188 [Conf]
    
13. Noel Novelli, Rosine Cicchetti
    FUN: An Efficient Algorithm for Mining Functional and Embedded Dependencies. [Citation Graph (0, 28)][DBLP]
    ICDT, 2001, pp:189-203 [Conf]
    
14. Toon Calders, Jan Paredaens
    Axiomatization of Frequent Sets. [Citation Graph (0, 9)][DBLP]
    ICDT, 2001, pp:204-218 [Conf]
    
15. Chen Li, Edward Y. Chang
    On Answering Queries in the Presence of Limited Access Patterns. [Citation Graph (0, 25)][DBLP]
    ICDT, 2001, pp:219-233 [Conf]
    
16. William Hesse
    The Dynamic Complexity of Transitive Closure Is In DynTC⁰. [Citation Graph (0, 9)][DBLP]
    ICDT, 2001, pp:234-247 [Conf]
    
17. Stephan Kreutzer
    Query Languages for Constraint Databases: First-Order Logic, Fixed-Points, and Convex Hulls. [Citation Graph (0, 9)][DBLP]
    ICDT, 2001, pp:248-262 [Conf]
    
18. Mary F. Fernández, Jérôme Siméon, Philip Wadler
    A Semi-monad for Semi-structured Data. [Citation Graph (0, 24)][DBLP]
    ICDT, 2001, pp:263-300 [Conf]
    
19. Gösta Grahne, Alex Thomo
    Algebraic Rewritings for Optimizing Regular Path Queries. [Citation Graph (0, 22)][DBLP]
    ICDT, 2001, pp:301-315 [Conf]
    
20. Peter Buneman, Sanjeev Khanna, Wang Chiew Tan
    Why and Where: A Characterization of Data Provenance. [Citation Graph (0, 8)][DBLP]
    ICDT, 2001, pp:316-330 [Conf]
    
21. Gabriel M. Kuper, Jérôme Siméon
    Subsumption for XML types. [Citation Graph (0, 19)][DBLP]
    ICDT, 2001, pp:331-345 [Conf]
    
22. Holger Meuss, Klaus U. Schulz, François Bry
    Towards Aggregated Answers for Semistructured Data. [Citation Graph (0, 17)][DBLP]
    ICDT, 2001, pp:346-360 [Conf]
    
23. Chung Keung Poon
    Orthogonal Range Queries in OLAP. [Citation Graph (0, 26)][DBLP]
    ICDT, 2001, pp:361-374 [Conf]
    
24. Carlos A. Hurtado, Alberto O. Mendelzon
    Reasoning about Summarizability in Heterogeneous Multidimensional Schemas. [Citation Graph (0, 14)][DBLP]
    ICDT, 2001, pp:375-389 [Conf]
    
25. Francesco Buccafurri, Filippo Furfaro, Domenico Saccà
    Estimating Range Queries Using Aggregate Data with Integrity Constraints: A Probabilistic Approach. [Citation Graph (0, 14)][DBLP]
    ICDT, 2001, pp:390-404 [Conf]
    
26. Anthony K. H. Tung, Raymond T. Ng, Laks V. S. Lakshmanan, Jiawei Han
    Constraint-based clustering in large databases. [Citation Graph (0, 12)][DBLP]
    ICDT, 2001, pp:405-419 [Conf]
    
27. Charu C. Aggarwal, Alexander Hinneburg, Daniel A. Keim
    On the Surprising Behavior of Distance Metrics in High Dimensional Spaces. [Citation Graph (0, 10)][DBLP]
    ICDT, 2001, pp:420-434 [Conf]
    
28. Stefan Berchtold, Christian Böhm, Daniel A. Keim, Florian Krebs, Hans-Peter Kriegel
    On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces. [Citation Graph (0, 20)][DBLP]
    ICDT, 2001, pp:435-449 [Conf]