Sciweavers

1000 search results - page 147 / 200
» Provenance for Aggregate Queries
Sort
View
WEA
2007
Springer
74views Algorithms» more  WEA 2007»
14 years 4 months ago
Landmark-Based Routing in Dynamic Graphs
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
Daniel Delling, Dorothea Wagner
ESA
2000
Springer
73views Algorithms» more  ESA 2000»
14 years 1 months ago
K-D Trees Are Better when Cut on the Longest Side
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
Matthew Dickerson, Christian A. Duncan, Michael T....
DBSEC
2007
104views Database» more  DBSEC 2007»
13 years 11 months ago
New Paradigm of Inference Control with Trusted Computing
Abstract. The database server is a crucial bottleneck in traditional inference control architecture, as it enforces highly computation-intensive auditing for all users who query th...
Yanjiang Yang, Yingjiu Li, Robert H. Deng
PVLDB
2008
111views more  PVLDB 2008»
13 years 9 months ago
Approximate lineage for probabilistic databases
In probabilistic databases, lineage is fundamental to both query processing and understanding the data. Current systems s.a. Trio or Mystiq use a complete approach in which the li...
Christopher Ré, Dan Suciu
OTM
2010
Springer
13 years 7 months ago
Supporting Complex Changes in Evolving Interrelated Web Databanks
In this paper we deal with problems occurring in evolving interrelated Web databanks. Examples of such databanks are networks of interlinked scientific repositories on the Web, man...
Yannis Stavrakas, George Papastefanatos