OODB Indexing by Class-Division
Summary: OODB indexing by class-division (CD) extends CH to accelerate range queries on class-attribute values. Implementable with B+-trees, CD delivers near-linear speedups over CH for many queries, with a 2–3× overhead and worst-case bounded by hierarchy depth and log size. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Sridhar Ramaswamy (Bell Communications Research; Brown University)
- 2. Paris C. Kanellakis (Brown University)
BibTeX Citation
@inproceedings{ramaswamy_sigmod95,
title = {{OODB Indexing by Class-Division}},
author = {Ramaswamy, Sridhar and Kanellakis, Paris C.},
series = {{SIGMOD} '95},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/223784.223809},
url = {https://dl.acm.org/doi/10.1145/223784.223809},
year = {1995}
}
Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,527 | On the Analysis of Indexing Schemes | 1997 | PODS | 0.00010326893 |
| 1,594 | Efficient Searching with Linear Constraints (Extended Abstract) | 1998 | PODS | 0.00010103178 |
| 1,654 | Indexing Moving Points (Extended Abstract) | 2000 | PODS | 9.9565797e-05 |
| 4,065 | Tight bounds for 2-dimensional indexing schemes | 1998 | PODS | 6.8104677e-05 |
| 4,862 | A Lower Bound Theorem for Indexing Schemes and its Application to Multidimensional Range Queries | 1998 | PODS | 6.3646378e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2 | R-Trees: A Dynamic Index Structure For Spatial Searching | 1984 | SIGMOD | 0.0019892478 |
| 34 | The Design Of Postgres | 1986 | SIGMOD | 0.00049063803 |
| 44 | The R+-Tree: A Dynamic Multi-Dimensional Index for Objects | 1987 | VLDB | 0.00045231517 |
| 102 | Spatial Query Processing in an Object-Oriented Database System | 1986 | SIGMOD | 0.00033850505 |
| 2,051 | Indexing for Data Models with Constraints and Classes (Extended Abstract) | 1993 | PODS | 9.1080736e-05 |
| 2,198 | H-trees: A Dynamic Associative Search Index for OODB | 1992 | SIGMOD | 8.8681957e-05 |
| 2,345 | Access Support in Object Bases | 1990 | SIGMOD | 8.5949475e-05 |
| 3,163 | Evaluation of Signature Files as Set Access Facilities in OODBs | 1993 | SIGMOD | 7.5611998e-05 |
| 6,594 | Indexing Multiple Sets | 1994 | VLDB | 5.7224736e-05 |
| 7,852 | The hcC-tree: An Efficient Index Structure For Object Oriented Databases | 1994 | VLDB | 5.4232053e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,514 | On Two-Dimensional Indexability and Optimal Range Search Indexing (Extended Abstract) | 1999 | PODS |
| 2 | 2,123 | A Dynamic Clustering Technique For Physical Database Design | 1980 | SIGMOD |
| 3 | 4,715 | A Performance Evaluation of OID Mapping Techniques | 1995 | VLDB |
| 4 | 2,076 | Query and Update Efficient B+-Tree Based Indexing of Moving Objects | 2004 | VLDB |
| 5 | 9,789 | Indexing Highly Dynamic Hierarchical Data | 2015 | VLDB |
| 6 | 12,828 | Worst-Case Efficient Range Search Indexing | 2009 | PODS |
| 7 | 4,153 | Join Index Hierarchies for Supporting Efficient Navigations in Object-Oriented Databases | 1994 | VLDB |
| 8 | 2,198 | H-trees: A Dynamic Associative Search Index for OODB | 1992 | SIGMOD |
| 9 | 2,051 | Indexing for Data Models with Constraints and Classes (Extended Abstract) | 1993 | PODS |
| 10 | 7,852 | The hcC-tree: An Efficient Index Structure For Object Oriented Databases | 1994 | VLDB |