Skip Navigation

The Computer Journal 1986 29(2):176-180; doi:10.1093/comjnl/29.2.176
© 1986 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Libera, F. D.
Right arrow Articles by Gosen, F.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Using B-trees to Solve Geographic Range Queries

F. D. Libera1 * and F. Gosen2

1 Facolta' di Scienze Statistiche Universita' di Padova, Padova, Italy, 2 Dipartimento di Urbanistica I.U.A.V. Venezia, Italy

We present an algorithm to solve range queries in an interactive Geographic Information System. The algorithm uses a quadtree as logical data structure implemented in a two-level memory environment as an inverted file (B-Tree) and accesses points using a search key built from the coordinates of the point itself.

This data structure is easily maintained by any file system, which also resolves problems pertaining to concurrency control and recovery.

The method is shown to have O({surd}F) expected running time, where F is the total number of points belonging to the requested region.

Received December 1983.

* Address for correspondence: F. Dalla Libera, Facolta' di Statistica Universita' Degli Studi di Padova, Via VIII Febbraio 2, 35100-Padova, Italy.

§ Facolta' di Scienze Statistiche Universita' di Padova

Dipartimento di Urbanistica I.U.A.V. Venezia


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.