Abstract
In spatial databases, efficient filtering of spatial objects using some index is a key issue to improve the retrieval performance R*-tree is a well-known index which can manage points and rectangles. In R*-tree, objects are approximated by their MBRs and input region is also approximated by its MBR. And exact check is postponed to the refinement step. This paper propose a new approach to this filter. Input region as well as each of stored objects is managed by a R*-tree which allows more exact approximation of it and so enables more efficient filtering. This design is used in our spatiotemporal database system Hawks whose data model, called Universe, is based on the simpficial complex theory.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Guttman. R-trees: a dynamic index structure for spatial searching. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 47–57, 1984.
D. A. White and R. Jain. Similarity indexing with the SS-tree. In Proceedings of the Twelfth International Conference on Data Engineering, pages 516–523, 1996.
J. T. Robinson. The K-D-B-tree: A search structure for large multidimensional dynamic indexes. In Proc. ACM SIGMOD Ann Arbor, USA, pages 10–18, 1981.
Jack Orenstein. Spatial query processing in an object-oriented database system. In Proceedings of the 1986 ACM SIGMOD, pages 326–336, 1986.
Michael Stonebraker, Jim Frew, Kenn Gardels, and Jeff Meredith. The sequoia 2000 storage benchmark. In Proceedings of the 1993 ACM SIGMOD, pages 2–11, 1993.
N. Beckmann, H. Peter Kriegel, R. Schneider, and B. Seeger. The R*-tree: An efficient and robust access method for points and rectangles. In Proceedings of the 1990 ACM SIGMOD, pages 322–331, 1990.
Preparata F.P. and Shamos M.I., editors. Computational Geometry. Springer, 1985.
S. Kuroki and A. Makinouchi. Design of the spatio-temporal data model universe using simplicial complexes. IPSJ SIG Notes (in Japanese), 109 (37), 1996.
S. Kuroki, K. Ishizuka, and A. Makinouchi. Towards a spatio-temporal oql for the four dimensional spatial database system hawks. In 8th Int. Conf. and Workshop on Database and Expert Systems Applications, page (to appear), 1995.
Shamos M. I. and bey D.J. Geometric intersection problems. Proc. 17th Annual Conf. on Foundations of Computer Science, pages 208–215, 1976.
T. Brinkhoff, H. P. Kriegel, and R. Schneider. Comparison of approximations of complex objects used for approximation-based query processing in spatial database systems. In Ninth International Conference on DATA ENGINEERING, pages 40–49, 1993.
Thomas Brinkhoff, Hans-Peter Kriegel, and Bernhard Seeger. Efficient processing of spatial joins using R-trees. In Proceedings of the 1993 ACM SIGMOD, pages 237–246, 1993.
Thomas Brinkhoff, Hans-Peter Kriegel, Ralf Schneider, and Bernhard Seeger. Multi-step processing of spatial joins. In Proceedings of the 1994 ACM SIGMOD, pages 197–208, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Horinokuchi, H., Wang, B., Kuroki, S., Makinouchi, A. (1999). A Spatiotemporal Query Processor Based on Simplicial Representation. In: Kambayashi, Y., Lee, D.L., Lim, EP., Mohania, M.K., Masunaga, Y. (eds) Advances in Database Technologies. ER 1998. Lecture Notes in Computer Science, vol 1552. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-49121-7_46
Download citation
DOI: https://doi.org/10.1007/978-3-540-49121-7_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65690-6
Online ISBN: 978-3-540-49121-7
eBook Packages: Springer Book Archive