Sciweavers

342 search results - page 4 / 69
» Branch-and-bound processing of ranked queries
Sort
View
EDBT
2009
ACM
113views Database» more  EDBT 2009»
14 years 2 months ago
Query ranking in probabilistic XML data
Twig queries have been extensively studied as a major fragment of XPATH queries to query XML data. In this paper, we study PXMLRANK query, (Q, k), which is to rank top-k probabili...
Lijun Chang, Jeffrey Xu Yu, Lu Qin
SIGMOD
2007
ACM
160views Database» more  SIGMOD 2007»
14 years 7 months ago
Supporting ranking and clustering as generalized order-by and group-by
The Boolean semantics of SQL queries cannot adequately capture the "fuzzy" preferences and "soft" criteria required in non-traditional data retrieval applicati...
Chengkai Li, Min Wang, Lipyeow Lim, Haixun Wang, K...
WWW
2004
ACM
14 years 8 months ago
Distributed ranking over peer-to-peer networks
Query flooding is a problem existing in Peer-to-Peer networks like Gnutella. Firework Query Model solves this problem by Peer Clustering and routes the query message more intellig...
Dexter Chi Wai Siu, Tak Pang Lau
PVLDB
2010
158views more  PVLDB 2010»
13 years 5 months ago
Building Ranked Mashups of Unstructured Sources with Uncertain Information
Mashups are situational applications that join multiple sources to better meet the information needs of Web users. Web sources can be huge databases behind query interfaces, which...
Mohamed A. Soliman, Ihab F. Ilyas, Mina Saleeb
XSYM
2004
Springer
115views Database» more  XSYM 2004»
14 years 24 days ago
XQuery Processing with Relevance Ranking
Abstract. We are presenting a coherent framework for XQuery processing that incorporates IR-style approximate matching and allows the ordering of results by their relevance score. ...
Leonidas Fegaras