Sciweavers

114 search results - page 5 / 23
» Dynamic Spatial Approximation Trees for Massive Data
Sort
View
ICDE
2010
IEEE
262views Database» more  ICDE 2010»
14 years 8 months ago
Approximate String Search in Spatial Databases
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
Bin Yao, Feifei Li, Marios Hadjieleftheriou, Kun H...
SIGMOD
2004
ACM
199views Database» more  SIGMOD 2004»
14 years 9 months ago
Approximate XML Query Answers
The rapid adoption of XML as the standard for data representation and exchange foreshadows a massive increase in the amounts of XML data collected, maintained, and queried over th...
Neoklis Polyzotis, Minos N. Garofalakis, Yannis E....
WETICE
1997
IEEE
14 years 1 months ago
Boundaries, Awareness and Interaction in Collaborative Virtual Environments
This paper is concerned with how collaborative virtual environments can be structured in order to enable greater scalability and yet maintain a richness of communication. Based on...
Chris Greenhalgh, Steve Benford
SIAMCOMP
1998
138views more  SIAMCOMP 1998»
13 years 8 months ago
Dynamic Trees and Dynamic Point Location
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
Michael T. Goodrich, Roberto Tamassia
ICC
2007
IEEE
180views Communications» more  ICC 2007»
14 years 3 months ago
Distributed Quad-Tree for Spatial Querying in Wireless Sensor Networks
— In contrast to the traditional wireless sensor network (WSN) applications that perform only data collection and aggregation, new generation of information processing applicatio...
Murat Demirbas, Xuming Lu