Sciweavers

2608 search results - page 12 / 522
» Inferring Answers to Queries
Sort
View
ADC
2009
Springer
178views Database» more  ADC 2009»
14 years 4 months ago
CSC: Supporting Queries on Compressed Cached XML
Whenever a client frequently has to retrieve, to query and to locally transform large parts of a huge XML document that is stored on a remote web information server, data exchange...
Stefan Böttcher, Rita Hartel
CORR
2010
Springer
160views Education» more  CORR 2010»
13 years 10 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
SIGMOD
2004
ACM
160views Database» more  SIGMOD 2004»
14 years 10 months ago
Extending Query Rewriting Techniques for Fine-Grained Access Control
Current day database applications, with large numbers of users, require fine-grained access control mechanisms, at the level of individual tuples, not just entire relations/views,...
Shariq Rizvi, Alberto O. Mendelzon, S. Sudarshan, ...
CORR
2010
Springer
138views Education» more  CORR 2010»
13 years 10 months ago
On building minimal automaton for subset matching queries
We address the problem of building an index for a set D of n strings, where each string location is a subset of some finite integer alphabet of size , so that we can answer effici...
Kimmo Fredriksson
UAI
2003
13 years 11 months ago
Approximate Decomposition: A Method for Bounding and Estimating Probabilistic and Deterministic Queries
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intract...
David Larkin