Paris C. Kanellakis, Sridhar Ramaswamy, Darren E. Vengroff, Jeffrey S. Vitter  Home/Search
Context Related
| brown.edu/pub/techreport...cs9321.ps.Z duke.edu/pub/dev/p...lassespods93.ps.Z brown.edu/pub/techreport...cs9321.ps.Z 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 Problem Downloading? From: brown.edu (more) From: duke.edu (Enter author homepages) |
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 secondary storage page size, and t the size of the output of a query. Indexing by one attribute ... (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):
35.8%: Indexing for Data Models with Constraints and Classes - Kanellakis, Ramaswamy.. (1993) (Correct)
29.1%: Indexing for Data Models with Classes and Constraints - Ramaswamy (1994) (Correct)
Active bibliography (related documents): More All
0.6: Path Caching: A Technique for Optimal External Searching.. - Ramaswamy, Subramanian (1994) (Correct)
0.6: OODB Indexing by Class-Division - Sridhar Ramaswamy (1995) (Correct)
0.3: Path Caching: A Technique for Optimal External Searching - Ramaswamy, Subramanian (1994) (Correct)
Similar documents based on text: More All
0.4: Dynamic and I/O-Efficient Algorithms for Computational Geometry.. - Chiang (1995) (Correct)
0.3: Functional Programming Formalisms for OODB Methods - Hillebrand, Kanellakis.. (1994) (Correct)
0.3: 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):666 The Design and Analysis of Spatial Data Structures (context) - Samet - 1989
561 Constraint Logic Programming (context) - Jaffar, Lassez - 1987 ACM DBLP
315 Constraint Query Languages - Kanellakis, Kuper et al. - 1990 ACM DBLP
229 Applications of Spatial Data Structures: Computer Graphics (context) - Samet - 1989
197 A Relational Model for Large Shared Data Banks (context) - Codd - 1970
183 A Data Structure for Dynamic Trees (context) - Sleator, Tarjan - 1983
111 Readings in Object-Oriented Database Systems (context) - Zdonik, Maier - 1990
106 Priority Search Trees (context) - McCreight - 1985
85 Object-Oriented Concepts (context) - Kim, Lochovsky - 1989
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
49 Indexing Techniques for Object-Oriented Databases (context) - Kim, Kim et al. - 1989 ACM 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
11 Efficient Memory Access in Large-Scale Computation (context) - Vitter - 1991 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 Maintaining Range Trees in Secondary Memory: Part II: Lower .. (context) - Smid, Overmars - 1990
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.math.jussieu.fr/~fermigie/fermivista/ftp/ftp.cs.brown.edu.html): More
Reinforcement Learning for Planning and Control - Dean, Basye, Shewchuk (1993) (Correct)
An Interactive 3D Toolkit for Constructing 3D Widgets - Zeleznik, Herndon.. (Correct)
Terminological Reasoning with Constraint Handling Rules - Frühwirth, Hanschke (1993) (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