Sciweavers

556 search results - page 23 / 112
» Evaluation of probabilistic queries in moving objects databa...
Sort
View
SSDBM
1998
IEEE
101views Database» more  SSDBM 1998»
13 years 11 months ago
Specifications for Efficient Indexing in Spatiotemporal Databases
: A new issue that arises in modern applications involves the efficient manipulation of (static or moving) spatial objects, and the relationships among them. As a result, modern da...
Yannis Theodoridis, Timos K. Sellis, Apostolos Pap...
SSD
2007
Springer
243views Database» more  SSD 2007»
14 years 1 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...
SIGMOD
2004
ACM
262views Database» more  SIGMOD 2004»
14 years 7 months ago
The Next Database Revolution
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
Jim Gray
CIKM
2009
Springer
14 years 9 hour ago
Scalable continuous range monitoring of moving objects in symbolic indoor space
Indoor spaces accommodate large populations of individuals. The continuous range monitoring of such objects can be used as a foundation for a wide variety of applications, e.g., s...
Bin Yang 0002, Hua Lu, Christian S. Jensen
VLDB
2008
ACM
178views Database» more  VLDB 2008»
14 years 7 months ago
The Bdual-Tree: indexing moving objects by space filling curves in the dual space
Abstract Existing spatiotemporal indexes suffer from either large update cost or poor query performance, except for the Bx -tree (the state-of-the-art), which consists of multiple ...
Man Lung Yiu, Yufei Tao, Nikos Mamoulis