The Twin Grid File: A Nearly Space Optimal Index Structure.
Andreas Hutflesz, Hans-Werner Six, Peter Widmayer:
The Twin Grid File: A Nearly Space Optimal Index Structure.
EDBT 1988: 352-363@inproceedings{DBLP:conf/edbt/HutfleszSW88,
author = {Andreas Hutflesz and
Hans-Werner Six and
Peter Widmayer},
editor = {Joachim W. Schmidt and
Stefano Ceri and
Michele Missikoff},
title = {The Twin Grid File: A Nearly Space Optimal Index Structure},
booktitle = {Advances in Database Technology - EDBT'88, Proceedings of the
International Conference on Extending Database Technology, Venice,
Italy, March 14-18, 1988},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {303},
year = {1988},
isbn = {3-540-19074-0},
pages = {352-363},
ee = {db/conf/edbt/HutfleszSW88.html},
crossref = {DBLP:conf/edbt/88},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX
CDROM Version: Load the CDROM "Volume 2 Issue 2, EDBT, ICDT, MFDBS, DASFAA" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
BibTeX
References
- [1]
- Ronald Fagin, Jürg Nievergelt, Nicholas Pippenger, H. Raymond Strong:
Extendible Hashing - A Fast Access Method for Dynamic Files.
ACM Trans. Database Syst. 4(3): 315-344(1979) BibTeX
- [2]
- Michael Freeston:
The BANG File: A New Kind of Grid File.
SIGMOD Conference 1987: 260-269 BibTeX
- [3]
- ...
- [4]
- Andreas Hutflesz, Hans-Werner Six, Peter Widmayer:
Globally Order Preserving Multidimensional Linear Hashing.
ICDE 1988: 572-579 BibTeX
- [5]
- Hans-Peter Kriegel, Bernhard Seeger:
Multidimensional Order Preserving Linear Hashing with Partial Expansions.
ICDT 1986: 203-220 BibTeX
- [6]
- ...
- [7]
- David B. Lomet:
Digital B-Trees.
VLDB 1981: 333-344 BibTeX
- [8]
- David B. Lomet:
Partial Expansions for File Organizations with an Index.
ACM Trans. Database Syst. 12(1): 65-84(1987) BibTeX
- [9]
- Jürg Nievergelt, Hans Hinterberger, Kenneth C. Sevcik:
The Grid File: An Adaptable, Symmetric Multikey File Structure.
ACM Trans. Database Syst. 9(1): 38-71(1984) BibTeX
- [10]
- Ekow J. Otoo:
Balanced Multidimensional Extendible Hash Tree.
PODS 1986: 100-113 BibTeX
- [11]
- Kotagiri Ramamohanarao, Ron Sacks-Davis:
Recursive Linear Hashing.
ACM Trans. Database Syst. 9(3): 369-391(1984) BibTeX
- [12]
- John T. Robinson:
The K-D-B-Tree: A Search Structure For Large Multidimensional Dynamic Indexes.
SIGMOD Conference 1981: 10-18 BibTeX
- [13]
- Hans-Werner Six, Peter Widmayer:
Spatial Searching in Geometric Databases.
ICDE 1988: 496-503 BibTeX
- [14]
- Markku Tamminen:
Extendible Hashing with Overflow.
Inf. Process. Lett. 15(5): 227-232(1982) BibTeX
Referenced by
- Hongjun Lu, Beng Chin Ooi:
Spatial Indexing: Past and Future.
IEEE Data Eng. Bull. 16(3): 16-21(1993)
- Goetz Graefe:
Query Evaluation Techniques for Large Databases.
ACM Comput. Surv. 25(2): 73-170(1993)
- Andreas Hutflesz, Hans-Werner Six, Peter Widmayer:
Twin Grid Files: Space Optimizing Access Schemes.
SIGMOD Conference 1988: 183-190
BibTeX
ACM SIGMOD Anthology - DBLP:
[Home | Search: Author, Title | Conferences | Journals]
Lecture Notes in Computer Science: Copyright © by Springer
Digitization of EDBT/ICDT/MFDBS proceedings was supported by the EDBT Endowment.
ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:08:34 2009