Sciweavers

386 search results - page 24 / 78
» Probabilistic Ranking of Database Query Results
Sort
View
PVLDB
2008
136views more  PVLDB 2008»
13 years 8 months ago
Keyword query cleaning
Unlike traditional database queries, keyword queries do not adhere to predefined syntax and are often dirty with irrelevant words from natural languages. This makes accurate and e...
Ken Q. Pu, Xiaohui Yu
VLDB
1997
ACM
80views Database» more  VLDB 1997»
14 years 1 months ago
Merging Ranks from Heterogeneous Internet Sources
Many sources on the Internet and elsewhere rank the objects in query results according to how well these objects match the original query. For example, a real-estate agent might r...
Luis Gravano, Hector Garcia-Molina
EDBT
2006
ACM
121views Database» more  EDBT 2006»
14 years 9 months ago
A Decomposition-Based Probabilistic Framework for Estimating the Selectivity of XML Twig Queries
In this paper we present a novel approach for estimating the selectivity of XML twig queries. Such a technique is useful for approximate query answering as well as for determining...
Chao Wang, Srinivasan Parthasarathy, Ruoming Jin
WWW
2006
ACM
14 years 9 months ago
A pruning-based approach for supporting Top-K join queries
An important issue arising from large scale data integration is how to efficiently select the top-K ranking answers from multiple sources while minimizing the transmission cost. T...
Jie Liu, Liang Feng, Yunpeng Xing
ICDM
2007
IEEE
122views Data Mining» more  ICDM 2007»
14 years 3 months ago
Representing Tuple and Attribute Uncertainty in Probabilistic Databases
There has been a recent surge in work in probabilistic databases, propelled in large part by the huge increase in noisy data sources — sensor data, experimental data, data from ...
Prithviraj Sen, Amol Deshpande, Lise Getoor