Cart (Loading....) | Create Account
Close category search window

An index structure for spatial joins in linear constraint databases

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Zhu, H. ; Dept. of Comput. Sci., California Univ., Santa Barbara, CA, USA ; Jianwen Su ; Ibarra, O.H.

Constraint databases integrate database technology with constraint solving to deal with new applications such as spatial or geographical applications and those requiring arithmetic computations. Although the conceptual framework is elegant, issues related to efficient query evaluation and optimization techniques have not been sufficiently addressed. We study efficient evaluation of spatial join in linear constraint databases in terms of the I/O complexity. We develop an extension of the classical B+-trees, called interval B+ -trees, and show that they can be used to efficiently evaluate the spatial join of relations with dense-order and linear constraints. Specifically, we develop a general algorithm for joining two sets of rectangles using interval B+-trees. We show that the algorithm has the worst case I/O complexity of O(bNlogb(N/b)+k), where N is the number of input rectangles and k the number of intersections. We show that the algorithm can be used in performing joins of relations with linear constraints. For relations with dense-order constraints where the spatial objects are not strictly rectangles, we extend the algorithm so that it can process the natural join of two N-tuple relations within O(bNlogb(N/b)+k) I/Os, where k is the number of intersections. It remains open if one can achieve the same upper bound in the linear case

Published in:

Data Engineering, 1999. Proceedings., 15th International Conference on

Date of Conference:

23-26 Mar 1999

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.