Sciweavers

253 search results - page 34 / 51
» Close pair queries in moving object databases
Sort
View
SUTC
2006
IEEE
16 years 18 hour ago
Transitive Nearest Neighbor Search in Mobile Environments
Given a query point p, typically the position of a current client, and two datasets S and R, a transitive nearest neighbor (TNN) search returns a pair of objects (s, r) ∈ S × R...
Baihua Zheng, Ken C. K. Lee, Wang-Chien Lee
ADC
2010
Springer
266views Database» more  ADC 2010»
15 years 1 months ago
Counting distinct objects over sliding windows
Aggregation against distinct objects has been involved in many real applications with the presence of duplicates, including real-time monitoring moving objects. In this paper, we ...
Wenjie Zhang, Ying Zhang, Muhammad Aamir Cheema, X...
ICDE
2007
IEEE
192views Database» more  ICDE 2007»
16 years 7 months ago
APLA: Indexing Arbitrary Probability Distributions
The ability to store and query uncertain information is of great benefit to databases that infer values from a set of observations, including databases of moving objects, sensor r...
Vebjorn Ljosa, Ambuj K. Singh
SIGMOD
2006
ACM
158views Database» more  SIGMOD 2006»
16 years 6 months ago
Continuous query processing in data streams using duality of data and queries
Recent data stream systems such as TelegraphCQ have employed the well-known property of duality between data and queries. In these systems, query processing methods are classified...
Hyo-Sang Lim, Jae-Gil Lee, Min-Jae Lee, Kyu-Young ...
ICDCS
2006
IEEE
16 years 2 days ago
Search-and-Discover in Mobile P2P Network Databases
In this paper we propose a novel algorithm called Rank-Based Broadcast (RBB) for discovery of local resources in mobile P2P networks. With RBB, each moving object periodically bro...
Ouri Wolfson, Bo Xu, Huabei Yin, Hu Cao