(Enter summary)
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).
Indexing by one attribute in many constraint data models is equivalent to external
dynamic interval management, which is a special case of external dynamic... (Update)
Context of citations to this paper: More
...and, in worst case, it is bounded by the depth of the hierarchy and the logarithm of its size. The results are described in Section 4; see [23] for more details. They offer strong proof that we can successfully trade a small amount of storage for good, guaranteed query times....
Cited by: More
OODB Indexing by Class-Division - Sridhar Ramaswamy (1995)
(Correct)
Similar documents (at the sentence level):
39.4%: Indexing for Data Models with Constraints and Classes - Kanellakis, Ramaswamy.. (1993)
(Correct)
18.8%: Path Caching: A Technique for Optimal External Searching - Ramaswamy, Subramanian (1994)
(Correct)
16.9%: Path Caching: A Technique for Optimal External Searching.. - Ramaswamy, Subramanian (1994)
(Correct)
Active bibliography (related documents): More All
0.6: The P-range tree: A new data structure for range searching.. - Subramanian, al. (1995)
(Correct)
0.4: Dynamic Algorithms in Computational Geometry - Chiang, Tamassia (1992)
(Correct)
0.3: Efficient External-Memory Data Structures and Applications - Arge (1996)
(Correct)
Similar documents based on text: More All
0.5: Fault-Tolerant and Efficient Parallel Computation - Shvartsman (1992)
(Correct)
0.2: Maintaining range .trees in secondary memory Part II.. - Ruu-Cs-.. (1987)
(Correct)
0.2: Finite Model Theory in the Simply Typed Lambda Calculus - Hillebrand (1994)
(Correct)
BibTeX entry: (Update)
S. Ramaswamy, "Indexing for Data Models with Classes and Constraints," Department of Computer Science, Brown University, Ph.D. Thesis, 1994. http://citeseer.ist.psu.edu/ramaswamy94indexing.html More
@misc{ ramaswamy94indexing,
author = "S. Ramaswamy",
title = "Indexing for Data Models with Classes and Constraints",
text = "S. Ramaswamy, Indexing for Data Models with Classes and Constraints, Department
of Computer Science, Brown University, Ph.D. Thesis, 1994.",
year = "1994",
url = "citeseer.ist.psu.edu/ramaswamy94indexing.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 ACM DBLP
210
Building an Object-Oriented Database System -- The Story o (context) - Bancilhon, Delobel et al. - 1992
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
103
Indexing for Data Models with Constraints and Classes
- Kanellakis, Ramaswamy et al. - 1993 ACM 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 ACM DBLP
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 ACM DBLP
53
Path Caching: A Technique for Optimal External Searching
- Ramaswamy, Subramanian - 1994 ACM DBLP
49
Indexing Techniques for Object-Oriented Databases (context) - Kim, Kim et al. - 1989 ACM DBLP
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
Fractional Cascading: I. A Data Structuring Technique (context) - Chazelle, Guibas - 1986 DBLP
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 ACM DBLP
14
XP-Trees -- External Priority Search Trees (context) - Blankenagel, Guting - 1990
13
A New Approach to Rectangle Intersections, Part (context) - Edelsbrunner - 1983
13
A New Approach to Rectangle Intersections, Part II (context) - Edelsbrunner - 1983
13
External Segment Trees (context) - Blankenagel, Guting - 1990 DBLP
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
Documents on the same site (http://www.bell-labs.com/user/sridhar/): More
OODB Indexing by Class-Division - Ramaswamy, Kanellakis (1995)
(Correct)
Indexing for Data Models with Constraints and Classes - Kanellakis, Ramaswamy.. (1993)
(Correct)
Efficient Indexing for Constraint and Temporal Databases - Ramaswamy (1997)
(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