Paris Kanellakis, Sridhar Ramaswamy, Darren Vengroff, Jeffrey Vitter  Home/Search
Context Related
Links: ACM DBLP | brown.edu/people/pck/Papers/krvv.ps belllabs.com/user/sridh...pods93.ps.gz brown.edu/people/pck/Papers/krvv.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: brown.edu/people/p...publications (more) Homepages: P.Kanellakis |
Rate this article:      (best)Comment on this article |
Abstract: We examine I/O-efficient data structures that provide indexing support for new data models. The database languages of these models include concepts from constraint programming (e.g., relational tuples are generalized to conjunctions of constraints) and from object-oriented programming (e.g., objects are organized in class hierarchies). Let n be the size of the database, c the number of classes, B the page size on secondary storage, and t the size of the output of a query. (1) Indexing by one... (Update)
Cited by: More
Experiments on the Practical I/O Efficiency of Geometric - Algorithms Distribution Sweep (Correct)
Constraint Query Algebras - Goldin (1997) (Correct)
Efficient Indexing Methods for Probabilistic.. - Cheng, Xia.. (2004) (Correct)
Similar documents (at the sentence level):
71.1%: Indexing for Data Models with Classes and Constraints - Ramaswamy (1994) (Correct)
15.2%: Indexing for Data Models with Constraints and Classes - Kanellakis, Ramaswamy.. (1993) (Correct)
Active bibliography (related documents): More All
0.7: Path Caching: A Technique for Optimal External Searching - Ramaswamy, Subramanian (1994) (Correct)
0.7: Path Caching: A Technique for Optimal External Searching.. - Ramaswamy, Subramanian (1994) (Correct)
0.6: The P-range tree: A new data structure for range searching.. - Subramanian, al. (1995) (Correct)
Similar documents based on text: More All
0.3: Dynamic programming on the word RAM - Pisinger (Correct)
0.1: Experiments on the Practical I/O Efficiency of Geometric.. - Chiang (1995) (Correct)
Related documents from co-citation: More All
40: Path caching: A technique for optimal external searching - Ramaswamy, Subramanian - 1994
31: Optimal dynamic interval management in external memory - Arge, Vitter - 1996
31: trees: A dynamic index structure for spatial searching (context) - Guttman - 1984
BibTeX entry: (Update)
P. C. Kanellakis, S. Ramaswamy, D. E. Vengroff, and J. S. Vitter. Indexing for data models with constraints and classes. In Proc. ACM Symp. on Principles of Database Sys., pages 233--243, 1993. http://citeseer.ist.psu.edu/article/kanellakis93indexing.html More
@inproceedings{ kanellakis93indexing,
author = "Paris C. Kanellakis and Sridhar Ramaswamy and Darren E. Vengroff and Jeffrey S. Vitter",
title = "Indexing for data models with constraints and classes (extended abstract)",
pages = "233--243",
year = "1993",
url = "citeseer.ist.psu.edu/article/kanellakis93indexing.html" }
Citations (may not include all citations):561 Constraint Logic Programming (context) - Jaffar, Lassez - 1987 ACM DBLP
315 Constraint Query Languages - Kanellakis, Kuper et al. - 1990
197 A Relational Model for Large Shared Data Banks (context) - Codd - 1970
134 Spatial Query Processing in an Object-Oriented Database Syst.. (context) - Orenstein - 1986 ACM DBLP
130 Tree: A Search Structure for Large Multidimensional Dynamic (context) - Robinson, K-D-B
121 External-Memory Computational Geometry - Goodrich, Tsay et al. - 1993
109 Multidimensional Divide and Conquer (context) - Bentley - 1980
106 Priority Search Trees (context) - McCreight - 1985 DBLP
88 The hB-Tree: A Multiattribute Indexing Method with Good Guar.. (context) - Lomet, Salzberg - 1990 ACM DBLP
85 Object-Oriented Concepts (context) - Kim, Lochovsky - 1989
84 The Grid File: An Adaptable, Symmetric Multikey File Structu.. (context) - Nievergelt, Hinterberger et al. - 1984
68 The Ubiquitous B-tree (context) - Comer - 1979 DBLP
63 Dynamic Algorithms in Computational Geometry - Chiang, Tamassia - 1992 ACM
54 Indexing in an Object-Oriented DBMS (context) - Maier, Stein - 1986
53 Path Caching: A Technique for Optimal External Searching - Ramaswamy, Subramanian - 1994 ACM DBLP
51 der, and B. Seeger, "The R -tree: An Efficient and Robust Ac.. (context) - Beckmann, Kriegel et al. - 1990
49 Indexing Techniques for Object-Oriented Databases (context) - Kim, Kim et al. - 1989
37 Algorithms for Klee's Rectangle Problems (context) - Bentley - 1977
35 The Design of the Cell Tree: An Object-Oriented Index Struct.. (context) - Gunther - 1989 DBLP
31 Organization of Large Ordered Indexes (context) - Bayer, McCreight - 1972
20 Priority Search Trees in Secondary Memory (context) - Icking, Klein et al. - 1988 ACM
17 A Lower Bound on the Complexity of Orthogonal Range Queries (context) - Fredman - 1981
14 XP-Trees -- External Priority Search Trees (context) - Blankenagel, Guting - 1990
13 A New Approach to Rectangle Intersections, Part (context) - Edelsbrunner - 1983
13 External Segment Trees (context) - Blankenagel, Guting - 1990 DBLP
13 A New Approach to Rectangle Intersections, Part II (context) - Edelsbrunner - 1983
9 Maintaining Range Trees in Secondary Memory: Part I: Partiti.. - Overmars, Smid et al. - 1990
8 H-trees: A Dynamic Associative Search Index for OODB (context) - Low, Ooi et al. - 1992 ACM DBLP
4 Lower Bounds for Orthogonal Range Searching: I. The Reportin.. (context) - Chazelle - 1990 ACM DBLP
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://wilma.cs.brown.edu/people/pck/publications.html): More
Controlling Memory Access Concurrency in Efficient.. - Kanellakis.. (1993) (Correct)
Method Schemas - Abiteboul, Kanellakis, Ramaswamy.. (1994) (Correct)
Efficient Parallelism Vs Reliable Distribution: A.. - Kanellakis.. (1994) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC