Sciweavers

253 search results - page 16 / 51
» Close pair queries in moving object databases
Sort
View
PODS
2008
ACM
165views Database» more  PODS 2008»
15 years 12 months ago
Data exchange and schema mappings in open and closed worlds
In the study of data exchange one usually assumes an openworld semantics, making it possible to extend instances of target schemas. An alternative closed-world semantics only move...
Leonid Libkin, Cristina Sirangelo
ICDE
2009
IEEE
198views Database» more  ICDE 2009»
16 years 1 months ago
V*-kNN: An Efficient Algorithm for Moving k Nearest Neighbor Queries
This demonstration program presents the V*-kNN algorithm, an efficient algorithm to process moving k nearest neighbor queries (MkNN). The V*-kNN algorithm is based on a safe-region...
Sarana Nutanong, Rui Zhang, Egemen Tanin, Lars Kul...
SIGMOD
2000
ACM
120views Database» more  SIGMOD 2000»
15 years 4 months ago
Indexing the Positions of Continuously Moving Objects
The coming years will witness dramatic advances in wireless communications as well as positioning technologies. As a result, tracking the changing positions of objects capable of ...
Simonas Saltenis, Christian S. Jensen, Scott T. Le...
CIKM
2005
Springer
15 years 1 months ago
Handling frequent updates of moving objects
A critical issue in moving object databases is to develop appropriate indexing structures for continuously moving object locations so that queries can still be performed efficien...
Bin Lin, Jianwen Su
DASFAA
2008
IEEE
156views Database» more  DASFAA 2008»
14 years 12 months ago
Load Balancing for Moving Object Management in a P2P Network
Abstract. Online games and location-based services now form the potential application domains for the P2P paradigm. In P2P systems, balancing the workload is essential for overall ...
Mohammed Eunus Ali, Egemen Tanin, Rui Zhang, Lars ...