Sciweavers

386 search results - page 38 / 78
» Probabilistic Ranking of Database Query Results
Sort
View
WWW
2002
ACM
14 years 9 months ago
Probabilistic question answering on the web
Web-based search engines such as Google and NorthernLight return documents that are relevant to a user query, not answers to user questions. We have developed an architecture that...
Dragomir R. Radev, Weiguo Fan, Hong Qi, Harris Wu,...
SIGMOD
2005
ACM
100views Database» more  SIGMOD 2005»
14 years 9 months ago
A Disk-Based Join With Probabilistic Guarantees
One of the most common operations in analytic query processing is the application of an aggregate function to the result of a relational join. We describe an algorithm for computi...
Chris Jermaine, Alin Dobra, Subramanian Arumugam, ...
ICDE
2008
IEEE
166views Database» more  ICDE 2008»
14 years 10 months ago
A Clustered Index Approach to Distributed XPath Processing
Supporting top-k queries over distributed collections of schemaless XML data poses two challenges. While XML supports expressive query languages such as XPath and XQuery, these la...
Georgia Koloniari, Evaggelia Pitoura
SIGMOD
2006
ACM
426views Database» more  SIGMOD 2006»
14 years 9 months ago
Effective keyword search in relational databases
With the amount of available text data in relational databases growing rapidly, the need for ordinary users to search such information is dramatically increasing. Even though the ...
Fang Liu, Clement T. Yu, Weiyi Meng, Abdur Chowdhu...
XSYM
2004
Springer
115views Database» more  XSYM 2004»
14 years 2 months 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