Sciweavers

493 search results - page 4 / 99
» Consensus answers for queries over probabilistic databases
Sort
View
DBPL
2001
Springer
102views Database» more  DBPL 2001»
13 years 12 months ago
View-Based Query Answering and Query Containment over Semistructured Data
Diego Calvanese, Giuseppe De Giacomo, Maurizio Len...
SIGIR
2010
ACM
13 years 5 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...
ICDE
2011
IEEE
215views Database» more  ICDE 2011»
12 years 11 months ago
Top-k keyword search over probabilistic XML data
—Despite the proliferation of work on XML keyword query, it remains open to support keyword query over probabilistic XML data. Compared with traditional keyword search, it is far...
Jianxin Li, Chengfei Liu, Rui Zhou, Wei Wang
VLDB
2007
ACM
95views Database» more  VLDB 2007»
14 years 7 months ago
Matching Twigs in Probabilistic XML
Evaluation of twig queries over probabilistic XML is investigated. Projection is allowed and, in particular, a query may be Boolean. It is shown that for a well-known model of pro...
Benny Kimelfeld, Yehoshua Sagiv
EDBT
2008
ACM
180views Database» more  EDBT 2008»
14 years 7 months ago
Probabilistic ranked queries in uncertain databases
Recently, many new applications, such as sensor data monitoring and mobile device tracking, raise up the issue of uncertain data management. Compared to "certain" data, ...
Xiang Lian, Lei Chen 0002