Sciweavers

505 search results - page 40 / 101
» Queries with Incomplete Answers over Semistructured Data
Sort
View
SIGIR
2010
ACM
14 years 7 months ago
DivQ: diversification for keyword search over structured databases
Keyword queries over structured databases are notoriously ambiguous. No single interpretation of a keyword query can satisfy all users, and multiple interpretations may yield over...
Elena Demidova, Peter Fankhauser, Xuan Zhou, Wolfg...
SIGMOD
2010
ACM
170views Database» more  SIGMOD 2010»
15 years 2 months ago
Querying data provenance
Many advanced data management operations (e.g., incremental maintenance, trust assessment, debugging schema mappings, keyword search over databases, or query answering in probabil...
Grigoris Karvounarakis, Zachary G. Ives, Val Tanne...
ICDE
2007
IEEE
145views Database» more  ICDE 2007»
15 years 11 months ago
Rewriting Regular XPath Queries on XML Views
We study the problem of answering queries posed on virtual views of XML documents, a problem commonly encountered when enforcing XML access control and integrating data. We approa...
Wenfei Fan, Floris Geerts, Xibei Jia, Anastasios K...
STACS
2010
Springer
15 years 4 months ago
Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation
We construct efficient data structures that are resilient against a constant fraction of adversarial noise. Our model requires that the decoder answers most queries correctly with...
Victor Chen, Elena Grigorescu, Ronald de Wolf
WIDM
2004
ACM
15 years 3 months ago
Querying structured data in an unstructured P2P system
Abstract— Peer-to-Peer networking has become a major research topic over the last few years. Sharing of structured data in such decentralized environments is a challenging proble...
Verena Kantere, Dimitrios Tsoumakos, Nick Roussopo...