Using the Holy Brick Tree for Spatial Data in General Purpose DBMSs.
Georgios Evangelidis, Betty Salzberg:
Using the Holy Brick Tree for Spatial Data in General Purpose DBMSs.
IEEE Data Eng. Bull. 16(3): 34-39(1993)@article{DBLP:journals/debu/EvangelidisS93,
author = {Georgios Evangelidis and
Betty Salzberg},
title = {Using the Holy Brick Tree for Spatial Data in General Purpose
DBMSs},
journal = {IEEE Data Eng. Bull.},
volume = {16},
number = {3},
year = {1993},
pages = {34-39},
ee = {db/journals/debu/EvangelidisS93.html},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
CDROM Version: Load the CDROM "Volume 1 Issue 2, SIGMOD '75-'92" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 2" and ...
Online Edition:
Data Engineering Bulletin September 1993:
Geographic Information Systems (Kyu-Young Whang, ed.)
( letter+figures ,
letter-figures ,
A4+figures , A4-figures , PDF+figures)
References
- [Ben79]
- Jon Louis Bentley:
Multidimensional Binary Search Trees in Database Applications.
IEEE Trans. Software Eng. 5(4): 333-340(1979)

- [ELS93]
- ...
- [Gut84]
- Antonin Guttman:
R-Trees: A Dynamic Index Structure for Spatial Searching.
SIGMOD Conference 1984: 47-57

- [Lom91]
- David B. Lomet:
Grow and Post Index Trees: Roles, Techniques and Future Potential.
SSD 1991: 183-206

- [LS90]
- David B. Lomet, Betty Salzberg:
The hB-Tree: A Multiattribute Indexing Method with Good Guaranteed Performance.
ACM Trans. Database Syst. 15(4): 625-658(1990)

- [LS92]
- David B. Lomet, Betty Salzberg:
Access Method Concurrency with Recovery.
SIGMOD Conference 1992: 351-360

- [LY81]
- Philip L. Lehman, S. Bing Yao:
Efficient Locking for Concurrent Operations on B-Trees.
ACM Trans. Database Syst. 6(4): 650-670(1981)

- [NHS84]
- 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)

- [OM84]
- Jack A. Orenstein, T. H. Merrett:
A Class of Data Structures for Associative Searching.
PODS 1984: 181-190

Copyright © Sun Nov 15 05:34:26 2009
by Michael Ley (ley@uni-trier.de)