Sciweavers

360 search results - page 49 / 72
» Indexing the Distance: An Efficient Method to KNN Processing
Sort
View
ICDE
2002
IEEE
143views Database» more  ICDE 2002»
14 years 9 months ago
Discovering Similar Multidimensional Trajectories
We investigate techniques for analysis and retrieval of object trajectories in a two or three dimensional space. Such kind of data usually contain a great amount of noise, that ma...
Michail Vlachos, Dimitrios Gunopulos, George Kolli...
ICDE
2007
IEEE
173views Database» more  ICDE 2007»
14 years 9 months ago
Accelerating Profile Queries in Elevation Maps
Elevation maps are a widely used spatial data representation in geographical information systems (GIS). Paths on elevation maps can be characterized by profiles, which describe re...
Feng Pan, Wei Wang 0010, Leonard McMillan
SSDBM
2002
IEEE
149views Database» more  SSDBM 2002»
14 years 16 days ago
A Cost Model for Interval Intersection Queries on RI-Trees
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
SISAP
2008
IEEE
98views Data Mining» more  SISAP 2008»
14 years 2 months ago
On Reinsertions in M-tree
In this paper we introduce a new M-tree building method, utilizing the classic idea of forced reinsertions. In case a leaf is about to split, some distant objects are removed from...
Jakub Lokoc, Tomás Skopal
SAC
2003
ACM
14 years 27 days ago
Improving Image Retrieval Effectiveness in Query-by-Example Environment
Query-by-example is the most popular query model for today’s image retrieval systems. A typical query image contains not only relevant objects (e.g., Eiffel Tower), but also ir...
Khanh Vu, Kien A. Hua, Ning Jiang