Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
The International Conference in Knowledge Management (CIKM'94), Gaithersburg, MD, November 1994. Hashing by Proximity to Process Duplicates in Spatial Databases
 

Summary: The International Conference in Knowledge Management (CIKM'94), Gaithersburg, MD, November 1994.
Hashing by Proximity to Process Duplicates in Spatial Databases
Walid G. Aref
Matsushita Information Technology Laboratory
Two Research Way
Princeton, New Jersey 08540
aref@mitl.research.panasonic.com
Hanan Samet
Computer Science Department and
Center for Automation Research and
Institute for Advanced Computer Studies
The University of Maryland
College Park, Maryland 20742
hjs@cs.umd.edu
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 opera­

  

Source: Aref, Walid - Department of Computer Sciences, Purdue University

 

Collections: Computer Technologies and Information Sciences