Sciweavers

3368 search results - page 48 / 674
» The Complexity of Query Reliability
Sort
View
ICEBE
2005
IEEE
168views Business» more  ICEBE 2005»
14 years 2 months ago
Frequency Operators for Condensative Queries over Data Streams
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 ...
Lisha Ma, Werner Nutt
ICDT
2009
ACM
149views Database» more  ICDT 2009»
14 years 9 months ago
Query languages for data exchange: beyond unions of conjunctive queries
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...
Juan Reutter, Marcelo Arenas, Pablo Barceló
IPTPS
2005
Springer
14 years 2 months ago
Arpeggio: Metadata Searching and Content Sharing with Chord
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...
Austin T. Clements, Dan R. K. Ports, David R. Karg...
IPM
2007
105views more  IPM 2007»
13 years 8 months ago
Parsimonious translation models for information retrieval
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...
Seung-Hoon Na, In-Su Kang, Jong-Hyeok Lee
PODS
2006
ACM
98views Database» more  PODS 2006»
14 years 9 months ago
Processing queries on tree-structured data efficiently
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...
Christoph Koch