Sridhar Ramaswamy Paris C. Kanellakis  Home/Search
Context Related
Links: ACM DBLP | brown.edu/people/pck/Pape...sigmod95.ps brown.edu/pub/techreport...cs9515.ps.Z brown.edu/people/pck/Pape...sigmod95.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) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Indexing a class hierarchy, in order to efficiently search or update the objects of a class according to a (range of) value(s) of an attribute, impacts OODB performance heavily. For this indexing problem, most systems use the class hierarchy index (CH) technique of [15] implemented using B + -trees. Other techniques, such as those of [14,18,30], can lead to improved average-case performance but involve the implementation of new data-structures, which are not as well-understood parts of... (Update)
Context of citations to this paper: More
...databases with class hierarchies, can be reduced to special cases of multidimensional range searching. In subsequent publications, [14, 13, 16, 17] there are presented asymptotically efficient dynamic algorithms for 2sided, 3 sided and interval management queries. An optimal...
...a set of intervals such that, given a query interval I q , all intervals intersecting I q can be reported eciently. As discussed in [28, 29, 37], the problem is crucial for indexing constraints in constraint databases and in temporal databases. The key component of dynamic...
Cited by: More
Experiments on the Practical I/O Efficiency of Geometric - Algorithms Distribution Sweep (Correct)
Optimal External Memory Interval Management - Arge, Vitter (2002) (Correct)
Indexing Moving Points - Agarwal, Arge, Erickson (2000) (Correct)
Similar documents (at the sentence level):
72.2%: OODB Indexing by Class-Division - Ramaswamy, Kanellakis (1995) (Correct)
23.7%: Indexing for Data Models with Classes and Constraints - Ramaswamy (1994) (Correct)
6.7%: Indexing for Data Models with Constraints and Classes - Kanellakis, Ramaswamy.. (1993) (Correct)
Active bibliography (related documents): More All
0.6: Path Caching: A Technique for Optimal External Searching.. - Ramaswamy, Subramanian (1994) (Correct)
0.4: Dynamic Algorithms in Computational Geometry - Chiang, Tamassia (1992) (Correct)
0.4: Path Caching: A Technique for Optimal External Searching - Ramaswamy, Subramanian (1994) (Correct)
Similar documents based on text: More All
0.2: Functional Programming Formalisms for OODB Methods - Hillebrand, Kanellakis.. (1994) (Correct)
0.2: Bulk Loading into an OODB: A Performance Study - Janet Wiener (1994) (Correct)
0.2: Translation of Object-Oriented Queries to Relational.. - Yu, Zhang, Meng, Kim.. (1995) (Correct)
Related documents from co-citation: More All
14: Indexing for data models with constraints and classes - Kanellakis, Ramaswamy et al. - 1993
13: Path caching: A technique for optimal external searching - Ramaswamy, Subramanian - 1994
7: range Tree: A New Data Structure for Range Searching in Secondary memory (context) - Subramanian, Ramaswamy - 1995
BibTeX entry: (Update)
S. Ramaswamy and P. C. Kanellakis. OODB indexing by class-division. In Proc. ACM SIGMOD Internat. Conf. on Management of Data, pages 139--150, 1995. http://citeseer.ist.psu.edu/article/ramaswamy95oodb.html More
@inproceedings{ ramaswamy95oodb,
author = "Sridhar Ramaswamy and Paris C. Kanellakis",
title = "{OODB} indexing by class-division",
pages = "139--150",
year = "1995",
url = "citeseer.ist.psu.edu/article/ramaswamy95oodb.html" }
Citations (may not include all citations):666 The Design and Analysis of Spatial Data Structures (context) - Samet - 1989 ACM
229 Applications of Spatial Data Structures: Computer Graphics (context) - Samet - 1989
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
152 The Design of POSTGRES - Stonebraker, Rowe - 1986 ACM DBLP
134 Spatial Query Processing in an Object-Oriented Database Syst.. (context) - Orenstein - 1986 ACM DBLP
111 Readings in Object-Oriented Database Systems (context) - Zdonik, Maier - 1990 ACM
109 Multidimensional Divide and Conquer (context) - Bentley - 1980
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
85 Object-Oriented Concepts (context) - Kim, Lochovsky - 1989
85 Indexing techniques for queries on nested objects (context) - Bertino, Kim - 1989 ACM DBLP
84 The Grid File: An Adaptable, Symmetric Multikey File Structu.. (context) - Nievergelt, Hinterberger et al. - 1984
73 Access support in Object Bases - Kemper, Moerkette - 1990 ACM DBLP
68 The Ubiquitous B-tree (context) - Comer - 1979 DBLP
63 Dynamic Algorithms in Computational Geometry - Chiang, Tamassia - 1992
63 The R + -Tree: A Dynamic Index for Multi-Dimensional Objects - Sellis, Roussopoulos et al. - 1987
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
47 The K-D-B Tree: A Search Structure for Large Multidimensiona.. (context) - Robinson - 1984
35 The Design of the Cell Tree: An Object-Oriented Index Struct.. (context) - Gunther - 1989 DBLP
34 Evaluation of signature files as set access facilities on oo.. - Ishikawa, Kitagawa et al. - 1993
31 Organization of Large Ordered Indexes (context) - Bayer, McCreight - 1972
20 Fractional Cascading: I. A Data Structuring Technique (context) - Chazelle, Guibas - 1986 DBLP
16 Indexing Multiple Sets - Kilger, Moerkotte - 1994 ACM 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
8 The hcC-tree: An Efficient Index Structure For Object Orient.. (context) - Sreenath, Seshadri - 1994 DBLP
4 Maintaining Range Trees in Secondary Memory: Part II: Lower .. (context) - Smid, Overmars - 1990
1 Indexing for Data Models with Classes and Constraints - Ramaswamy - 1994 ACM
1 available by ftp from ftp (context) - Seltzer, Bostic et al.
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