Hashing by Proximity to Process Duplicates in Spatial Databases.

Walid G. Aref, Hanan Samet: Hashing by Proximity to Process Duplicates in Spatial Databases. CIKM 1994: 347-354

@inproceedings{DBLP:conf/cikm/ArefS94,
  author    = {Walid G. Aref and
               Hanan Samet},
  title     = {Hashing by Proximity to Process Duplicates in Spatial Databases},
  booktitle = {Proceedings of the Third International Conference on Information
               and Knowledge Management (CIKM'94), Gaithersburg, Maryland, November
               29 - December 2, 1994},
  publisher = {ACM},
  year      = {1994},
  pages     = {347-354},
  ee        = {db/conf/cikm/ArefS94.html, http://doi.acm.org/10.1145/191246.191307},
  crossref  = {DBLP:conf/cikm/94},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

BibTeX

Abstract

In a spatial database, an object may extend arbitrarily in space. As a result, many spatial data structures (e.g., the quadtree, the cell tree, the R⁺-tree) represent an object by partitioning it into multiple, yet simple, pieces, each of which is stored separately inside the data structure. Many operations on these data structures are likely to produce duplicate results because of the multiplicity of object pieces. A novel approach for duplicate processing based on proximity of spatial objects is presented. This is different from conventional duplicate elimination in database systems because, with spatial databases, different pieces of the same object can span multiple buckets of the underlying data structure. Example algorithms are presented to perform duplicate processing using proximity for quadtree representation of line segments and arbitrary rectangles. The complexity of the algorithms is seen to depend on a geometric classification of different instances of the spatial objects. By using proximity and the spatial properties of the objects, the number of disk-I/O requests as well as the run-time storage during duplicate processing can be reduced.

Copyright © 1994 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

CDROM Version: Load the CDROM "Volume 2 Issue 4, CIKM, DOLAP, GIS, SIGFIDET, ..." 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/An2-4 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

BibTeX

Printed Edition

Proceedings of the Third International Conference on Information and Knowledge Management (CIKM'94), Gaithersburg, Maryland, November 29 - December 2, 1994. ACM 1994
Contents BibTeX

Online Edition

Citation Page BibTeX

BibTeX

ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]

CIKM 1994 Proceedings, ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:01:46 2009