Sciweavers

104 search results - page 6 / 21
» Query ranking in probabilistic XML data
Sort
View
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
ICEIS
2009
IEEE
14 years 2 months ago
Relaxing XML Preference Queries for Cooperative Retrieval
Today XML is an essential technology for knowledge management within enterprises and dissemination of data over the Web. Therefore the efficient evaluation of XML queries has been ...
SungRan Cho, Wolf-Tilo Balke
EDBT
2011
ACM
205views Database» more  EDBT 2011»
12 years 11 months ago
A probabilistic XML merging tool
This demonstration paper presents a probabilistic XML data merging tool, that represents the outcome of semi-structured document integration as a probabilistic tree. The system is...
Talel Abdessalem, M. Lamine Ba, Pierre Senellart
WEBDB
2004
Springer
170views Database» more  WEBDB 2004»
14 years 24 days ago
Content and Structure in Indexing and Ranking XML
Rooted in electronic publishing, XML is now widely used for modelling and storing structured text documents. Especially in the WWW, retrieval of XML documents is most useful in co...
Felix Weigel, Holger Meuss, Klaus U. Schulz, Fran&...
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
14 years 7 months ago
Ranking distributed probabilistic data
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
Feifei Li, Ke Yi, Jeffrey Jestes