Direct Spatial Search on Pictorial Databases Using Packed R-Trees.

Nick Roussopoulos, Daniel Leifker: Direct Spatial Search on Pictorial Databases Using Packed R-Trees. SIGMOD Conference 1985: 17-31

@inproceedings{DBLP:conf/sigmod/RoussopoulosL85,
  author    = {Nick Roussopoulos and
               Daniel Leifker},
  editor    = {Shamkant B. Navathe},
  title     = {Direct Spatial Search on Pictorial Databases Using Packed R-Trees},
  booktitle = {Proceedings of the 1985 ACM SIGMOD International Conference on
               Management of Data, Austin, Texas, May 28-31, 1985},
  publisher = {ACM Press},
  year      = {1985},
  pages     = {17-31},
  ee        = {http://doi.acm.org/10.1145/318898.318900},
  crossref  = {DBLP:conf/sigmod/85},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Pictorial databases require efficient and direct spatial search based on the analog form of spatial objects and relationships instead of search based on some cumbersome alphanumeric encodings of the pictures. R-trees (two-dimensional B-trees) are excellent devices for indexing spatial objects and relationships found on pictures. Their most important feature is that they provide high level object oriented search rather than search based on the low level elements of spatial objects. This paper presents an efficient initial packing technique for creating R-trees to indexspatial objects. Since pictorial databases are not update intensive but rather static, the benefits of this technique are very significant.

Copyright © 1985 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.

ACM SIGMOD Anthology

Online Version (ACM WWW Account required): Full Text in PDF Format

CDROM Version: Load the CDROM "Volume 1 Issue 2, SIGMOD '75-'92" and ...

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the CD and click on the path of your mount point:
/Anthology/smod7592 or /cdrom

DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the DVD and click on the path of your mount point:
/Anthology/aDVD1 or /dvd

Printed Edition

Shamkant B. Navathe (Ed.): Proceedings of the 1985 ACM SIGMOD International Conference on Management of Data, Austin, Texas, May 28-31, 1985. ACM Press 1985

, SIGMOD Record 14(4)
Contents

Online Edition: ACM Digital Library

References

[Bayer & McCreight 1972]: Rudolf Bayer, Edward M. McCreight: Organization and Maintenance of Large Ordered Indices. Acta Inf. 1: 173-189(1972)
[Chamberlin et al 1976]: ...
[Chang 1981]: ...
[Chang & Fu 1981]: ...
[Chang & Kunil 1981]: ...
[Finkel & Bentkey 1984]: Raphael A. Finkel, Jon Louis Bentley: Quad Trees: A Data Structure for Retrieval on Composite Keys. Acta Inf. 4: 1-9(1974)
[Guttman 1984]: Antonin Guttman: R-Trees: A Dynamic Index Structure for Spatial Searching. SIGMOD Conference 1984: 47-57
[Kent 1979]: William Kent: Limitations of Record-Based Information Models. ACM Trans. Database Syst. 4(1): 107-131(1979)
[Lin & Chang 1980]: ...
[McKeown 1983a]: ...
[McKeown 1983b]: ...
[Powell & Linton]: ...
[Roussopoulos 1984]: ...
[Roussopoulos & Leifker 1984]: ...
[Stonebraker et al 1983]: ...
[Stonebraker et al 1984]: Michael Stonebraker, Erika Anderson, Eric N. Hanson, W. Bradley Rubenstein: Quel as a Data Type. SIGMOD Conference 1984: 208-214
[Tang 1980]: ...
[Zaniolo 1983]: Carlo Zaniolo: The Database Language GEM. SIGMOD Conference 1983: 207-218

Last update Tue Sep 18 00:24:58 2012 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page