Sciweavers

91 search results - page 11 / 19
» The hcC-tree: An Efficient Index Structure for Object Orient...
Sort
View
ITNG
2008
IEEE
14 years 3 months ago
An Efficient Technique for Distance Computation in Road Networks
With recent advances in wireless communication and position technologies, it became possible to collect and record trajectories of moving objects. Thus, many services in road netw...
Xu Jianqiu, Victor Teixeira de Almeida, Qin Xiaoli...
GIS
2002
ACM
13 years 8 months ago
A road network embedding technique for k-nearest neighbor search in moving object databases
A very important class of queries in GIS applications is the class of K-Nearest Neighbor queries. Most of the current studies on the K-Nearest Neighbor queries utilize spatial ind...
Cyrus Shahabi, Mohammad R. Kolahdouzan, Mehdi Shar...
EDBT
2008
ACM
169views Database» more  EDBT 2008»
14 years 8 months ago
Efficient online top-K retrieval with arbitrary similarity measures
The top-k retrieval problem requires finding k objects most similar to a given query object. Similarities between objects are most often computed as aggregated similarities of the...
Prasad M. Deshpande, Deepak P, Krishna Kummamuru
GIS
2005
ACM
14 years 9 months ago
Shapes based trajectory queries for moving objects
An interesting issue in moving objects databases is to find similar trajectories of moving objects. Previous work on this topic focuses on movement patterns (trajectories with tim...
Bin Lin, Jianwen Su
VLDB
2007
ACM
91views Database» more  VLDB 2007»
14 years 8 months ago
On Dominating Your Neighborhood Profitably
Recent research on skyline queries has attracted much interest in the database and data mining community. Given a database, an object belongs to the skyline if it cannot be domina...
Cuiping Li, Anthony K. H. Tung, Wen Jin, Martin Es...