Sciweavers

466 search results - page 25 / 94
» Efficient Object Querying for Java
Sort
View
SSD
2007
Springer
243views Database» more  SSD 2007»
15 years 4 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...
GIS
2007
ACM
15 years 11 months ago
TS2-tree - an efficient similarity based organization for trajectory data
The increasingly popular GPS technology and the growing amount of trajectory data it generates create the need for developing applications that efficiently store and query traject...
Petko Bakalov, Eamonn J. Keogh, Vassilis J. Tsotra...
EDBT
2000
ACM
15 years 1 months ago
Management and Query Processing of One-Dimensional Intervals with the UB-Tree
The management and query processing of one dimensional intervals is a special case of extended object handling. One dimensional intervals play an important role in temporal databa...
Robert Fenk
ICDE
2008
IEEE
301views Database» more  ICDE 2008»
15 years 11 months ago
A Hybrid Prediction Model for Moving Objects
Existing prediction methods in moving objects databases cannot forecast locations accurately if the query time is far away from the current time. Even for near future prediction, m...
Hoyoung Jeung, Qing Liu, Heng Tao Shen, Xiaofang Z...
VLDB
2005
ACM
177views Database» more  VLDB 2005»
15 years 10 months ago
Indexing mobile objects using dual transformations
With the recent advances in wireless networks, embedded systems and GPS technology, databases that manage the location of moving objects have received increased interest. In this ...
George Kollios, Dimitris Papadopoulos, Dimitrios G...