Sciweavers

376 search results - page 4 / 76
» On the semantics and evaluation of top-k queries in probabil...
Sort
View
PODS
2007
ACM
131views Database» more  PODS 2007»
14 years 7 months ago
Provenance semirings
We show that relational algebra calculations for incomplete databases, probabilistic databases, bag semantics and whyprovenance are particular cases of the same general algorithms...
Todd J. Green, Gregory Karvounarakis, Val Tannen
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
IDEAS
2007
IEEE
146views Database» more  IDEAS 2007»
14 years 1 months ago
Approximate Structural Matching over Ordered XML Documents
There is an increasing need for an XML query engine that not only searches for exact matches to a query but also returns “query-like” structures. We have designed and develope...
Nitin Agarwal, Magdiel Galan Oliveras, Yi Chen
VLDB
2004
ACM
77views Database» more  VLDB 2004»
14 years 9 days ago
Efficient Query Evaluation on Probabilistic Databases
Nilesh N. Dalvi, Dan Suciu
EDBT
2009
ACM
208views Database» more  EDBT 2009»
14 years 1 months ago
Flexible and efficient querying and ranking on hyperlinked data sources
There has been an explosion of hyperlinked data in many domains, e.g., the biological Web. Expressive query languages and effective ranking techniques are required to convert this...
Ramakrishna Varadarajan, Vagelis Hristidis, Louiqa...