Sciweavers

145 search results - page 15 / 29
» On Using Query Logs for Static Index Pruning
Sort
View
EDBT
2010
ACM
185views Database» more  EDBT 2010»
13 years 10 months ago
Probabilistic threshold k nearest neighbor queries over moving objects in symbolic indoor space
The availability of indoor positioning renders it possible to deploy location-based services in indoor spaces. Many such services will benefit from the efficient support for k n...
Bin Yang 0002, Hua Lu, Christian S. Jensen
GIS
2007
ACM
14 years 9 months ago
Proximity queries in large traffic networks
In this paper, we present an original network graph embedding to speed-up distance-range and k-nearest neighbor queries in (weighted) graphs. Our approach implements the paradigm ...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...
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
VLDB
2004
ACM
113views Database» more  VLDB 2004»
14 years 1 months ago
Auditing Compliance with a Hippocratic Database
We introduce an auditing framework for determining whether a database system is adhering to its data disclosure policies. Users formulate audit expressions to specify the (sensiti...
Rakesh Agrawal, Roberto J. Bayardo Jr., Christos F...
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
14 years 8 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang