Sciweavers

145 search results - page 19 / 29
» On Using Query Logs for Static Index Pruning
Sort
View
SSD
2005
Springer
153views Database» more  SSD 2005»
15 years 10 months ago
Constrained Shortest Path Computation
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequen...
Manolis Terrovitis, Spiridon Bakiras, Dimitris Pap...
PAMI
2008
152views more  PAMI 2008»
15 years 4 months ago
K-Nearest Neighbor Finding Using MaxNearestDist
Abstract-Similarity searching often reduces to finding the k nearest neighbors to a query object. Finding the k nearest neighbors is achieved by applying either a depth-first or a ...
Hanan Samet
ICDE
2010
IEEE
491views Database» more  ICDE 2010»
16 years 4 months ago
TrajStore: An Adaptive Storage System for Very Large Trajectory Data Sets
The rise of GPS and broadband-speed wireless devices has led to tremendous excitement about a range of applications broadly characterized as "location based services". Cu...
Philippe Cudré-Mauroux, Eugene Wu, Samuel M...
MICS
2010
137views more  MICS 2010»
15 years 2 months ago
Finding Range Minima in the Middle: Approximations and Applications
Abstract. A Range Minimum Query asks for the position of a minimal element between two specified array-indices. We consider a natural extension of this, where our further constrai...
Johannes Fischer, Volker Heun
WWW
2007
ACM
16 years 5 months ago
Dynamic personalized pagerank in entity-relation graphs
Extractors and taggers turn unstructured text into entityrelation (ER) graphs where nodes are entities (email, paper, person, conference, company) and edges are relations (wrote, ...
Soumen Chakrabarti