ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Using two B+-trees to efficiently process inclusion spatial queries (extended abstract)
Full text PdfPdf (660 KB)
Source Geographic Information Systems archive
Proceedings of the 5th ACM international workshop on Advances in geographic information systems table of contents
Las Vegas, Nevada, United States
Pages: 5 - 8  
Year of Publication: 1997
ISBN:1-58113-017-1
Authors
Mario A. Nascimento  CNPTIA-EMBRAPA, PO Box 6041, 13083-970 Campinas SP BRAZIL
Margaret H. Dunham  CSE-SEAS, Southern Methodist University, Dallas TX
Sponsors
SIGGROUP: ACM Special Interest Group on Supporting Group Work
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGIR: ACM Special Interest Group on Information Retrieval
SIGLINK: Hypertext, Hypermedia, and Web
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 20,   Citation Count: 1
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/267825.267992
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
Norbert Beckmann , Hans-Peter Kriegel , Ralf Schneider , Bernhard Seeger, The R*-tree: an efficient and robust access method for points and rectangles, Proceedings of the 1990 ACM SIGMOD international conference on Management of data, p.322-331, May 23-26, 1990, Atlantic City, New Jersey, United States
 
2
Christos Faloutsos , Yi Rong, DOT: A Spatial Access Method Using Fractals, Proceedings of the Seventh International Conference on Data Engineering, p.152-159, April 08-12, 1991
3
Antonin Guttman, R-trees: a dynamic index structure for spatial searching, Proceedings of the 1984 ACM SIGMOD international conference on Management of data, June 18-21, 1984, Boston, Massachusetts
4
Jan Jannink, Implementing deletion in B+-trees, ACM SIGMOD Record, v.24 n.1, p.33-38, March 1995  [doi>10.1145/202660.202666]
5
Theodore Johnson , Dennis Sasha, The performance of current B-tree algorithms, ACM Transactions on Database Systems (TODS), v.18 n.1, p.51-101, March 1993  [doi>10.1145/151284.151286]
6
Ibrahim Kamel , Christos Faloutsos, Parallel R-trees, Proceedings of the 1992 ACM SIGMOD international conference on Management of data, p.195-204, June 02-05, 1992, San Diego, California, United States
 
7
NASCIMENTO, M., AND DUNHAM, M. Using B+4rces as a practical alternative to the classical R-tree. In 1 lth SBBD (S~o Carlos, Brazil, October 1996), pp. 187-200.
 
8
NASOIMENTO, M., AND DUNHAM, M. Indexing valid time databases via B+-trees - the MAP21 approach. Tech. Rep. CSF_,-97-08, School of Engineering and Applied Sciences, Southern Methodist University, Dallas, USA, 1997.
9
Dimitris Papadias , Timos Sellis , Yannis Theodoridis , Max J. Egenhofer, Topological relations in the world of minimum bounding rectangles: a study with R-trees, Proceedings of the 1995 ACM SIGMOD international conference on Management of data, p.92-103, May 22-25, 1995, San Jose, California, United States
 
10
Hanan Samet, The design and analysis of spatial data structures, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1990
 
11
Timos K. Sellis , Nick Roussopoulos , Christos Faloutsos, The R+-Tree: A Dynamic Index for Multi-Dimensional Objects, Proceedings of the 13th International Conference on Very Large Data Bases, p.507-518, September 01-04, 1987
 
12
THEODOB.mIS, Y., AND PAPADIAS, D. Range queries involving spatial relations: A performance analysis, in 2rid GOSIT (Semmering, Austria, September 1995).

CITED BY
Mario A. Nascimento , Margaret H. Dunham, Indexing Valid Time Databases via B+-Trees, IEEE Transactions on Knowledge and Data Engineering, v.11 n.6, p.929-947, November 1999

INDEX TERMS

Primary Classification:
  E. Data
  E.1 DATA STRUCTURES
      Subjects: Trees

Additional Classification:
  H. Information Systems
  H.3 INFORMATION STORAGE AND RETRIEVAL
      H.3.1 Content Analysis and Indexing
          Subjects: Indexing methods
      H.3.3 Information Search and Retrieval
          Subjects: Query formulation


General Terms:
Algorithms, Performance

Collaborative Colleagues:
Mario A. Nascimento: colleagues
Margaret H. Dunham: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player