3368 search results - page 48 / 674 » The Complexity of Query Reliability |
107
click to vote
ICEBE
2005
IEEE
15 years 5 months ago
2005
IEEE
Over a traditional Database Management System (DBMS), the answer to an aggregate query is usually much smaller than the answer to a similar nonaggregate query. Therefore, we call ...
196
click to vote
ICDT
2009
ACM
16 years 16 days ago
2009
ACM
The class of unions of conjunctive queries (UCQ) has been shown to be particularly well-behaved for data exchange; its certain answers can be computed in polynomial time (in terms...
IPTPS
2005
Springer
15 years 5 months ago
2005
Springer
Arpeggio is a peer-to-peer file-sharing network based on the Chord lookup primitive. Queries for data whose metadata matches a certain criterion are performed efficiently by using...
109
click to vote
IPM
2007
14 years 11 months ago
2007
In the KL divergence framework, the extended language modeling approach has a critical problem estimating a query model, which is the probabilistic model that encodes user’s inf...
85
Voted
PODS
2006
ACM
15 years 12 months ago
2006
ACM
This is a survey of algorithms, complexity results, and general solution techniques for efficiently processing queries on tree-structured data. I focus on query languages that com...