Sciweavers

2853 search results - page 344 / 571
» On the Efficiency of Provenance Queries
Sort
View
CORR
2008
Springer
96views Education» more  CORR 2008»
15 years 6 months ago
Time Dependent Contraction Hierarchies -- Basic Algorithmic Ideas
Contraction hierarchies are a simple hierarchical routing technique that has proved extremely efficient for static road networks. We explain how to generalize them to networks wit...
Peter Sanders
SIGMOD
2009
ACM
198views Database» more  SIGMOD 2009»
16 years 6 months ago
Monitoring path nearest neighbor in road networks
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
Zaiben Chen, Heng Tao Shen, Xiaofang Zhou, Jeffrey...
ICDE
2010
IEEE
219views Database» more  ICDE 2010»
16 years 6 months ago
PIP: A Database System for Great and Small Expectations
Estimation via sampling out of highly selective join queries is well known to be problematic, most notably in online aggregation. Without goal-directed sampling strategies, samples...
Oliver Kennedy, Christoph Koch
BTW
2007
Springer
142views Database» more  BTW 2007»
16 years 24 days ago
Getting Prime Cuts from Skylines over Partially Ordered Domains
: Skyline queries have recently received a lot of attention due to their intuitive query formulation: users can state preferences with respect to several attributes. Unlike numeric...
Wolf-Tilo Balke, Wolf Siberski, Ulrich Güntze...
CORR
2010
Springer
160views Education» more  CORR 2010»
15 years 6 months ago
Scalable Probabilistic Databases with Factor Graphs and MCMC
Incorporating probabilities into the semantics of incomplete databases has posed many challenges, forcing systems to sacrifice modeling power, scalability, or treatment of relatio...
Michael L. Wick, Andrew McCallum, Gerome Miklau