Sciweavers

705 search results - page 59 / 141
» Approximating Extended Answer Sets
Sort
View
JLP
2000
102views more  JLP 2000»
14 years 9 months ago
Recursive Query Plans for Data Integration
Generating query-answering plans for data integration systems requires to translate a user query, formulated in terms of a mediated schema, to a query that uses relations that are...
Oliver M. Duschka, Michael R. Genesereth, Alon Y. ...
FOCS
2009
IEEE
15 years 4 months ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu
IPPS
2007
IEEE
15 years 4 months ago
A Scalable Cluster Algorithm for Internet Resources
Applications such as parallel computing, online games, and content distribution networks need to run on a set of resources with particular network connection characteristics to ge...
Chuang Liu, Ian T. Foster
EDBTW
2006
Springer
15 years 1 months ago
Constructing Optimal Wavelet Synopses
The wavelet decomposition is a proven tool for constructing concise synopses of massive data sets and rapid changing data streams, which can be used to obtain fast approximate, wit...
Dimitris Sacharidis
ICDT
2010
ACM
219views Database» more  ICDT 2010»
15 years 7 months ago
Aggregate Queries for Discrete and Continuous Probabilistic XML
Sources of data uncertainty and imprecision are numerous. A way to handle this uncertainty is to associate probabilistic annotations to data. Many such probabilistic database mode...
Serge Abiteboul, T.-H Hubert Chan, Evgeny Kharlamo...