Sciweavers

192 search results - page 4 / 39
» Analyzing Range Queries on Spatial Data
Sort
View
ICDE
1999
IEEE
113views Database» more  ICDE 1999»
14 years 9 months ago
I/O Complexity for Range Queries on Region Data Stored Using an R-tree
In this paper we study the node distribution of an Rtree storing region data, like for instance islands, lakes or human-inhabited areas. We will show that real region datasets are...
Guido Proietti, Christos Faloutsos
COMPSAC
2004
IEEE
13 years 11 months ago
Spatial Data Query Support in Peer-to-Peer Systems
Recently distributed hash table (DHT) mechanisms have been proposed to manage data in very large, structured peer-to-peer (P2P) systems. DHT algorithms provide efficient exact-mat...
Roger Zimmermann, Wei-Shinn Ku, Haojun Wang
GIS
2006
ACM
14 years 8 months ago
Analyzing theme, space, and time: an ontology-based approach
The W3C's Semantic Web Activity is illustrating the use of semantics for information integration, search, and analysis. However, the majority of the work in this community ha...
Matthew Perry, Farshad Hakimpour, Amit P. Sheth
ICDE
1998
IEEE
119views Database» more  ICDE 1998»
14 years 9 months ago
Processing Incremental Multidimensional Range Queries in a Direct Manipulation Visual Query
We have developed a MultiMedia Visual Information Seeking (MMVIS) Environment that is the first system to support an integrated approach to the direct manipulation specification o...
Stacie Hibino, Elke A. Rundensteiner
SODA
1997
ACM
144views Algorithms» more  SODA 1997»
13 years 9 months ago
Methods for Achieving Fast Query Times in Point Location Data Structures
Given a collection S of n line segments in the plane, the planar point location problem is to construct a data structure that can e ciently determine for a given query point p the...
Michael T. Goodrich, Mark W. Orletsky, Kumar Ramai...