Sciweavers

306 search results - page 7 / 62
» Probabilistic ranking for relational databases based on corr...
Sort
View
ICDE
2008
IEEE
152views Database» more  ICDE 2008»
14 years 2 months ago
Automated generation of object summaries from relational databases: A novel keyword searching paradigm
— This paper introduces a novel keyword searching paradigm in Relational Databases (DBs), where the result of a search is a ranked set of Object Summaries (OSs). An OS summarizes...
Georgios John Fakas
VLDB
2004
ACM
161views Database» more  VLDB 2004»
14 years 8 months ago
Supporting top-k join queries in relational databases
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
Ihab F. Ilyas, Walid G. Aref, Ahmed K. Elmagarmid
SIGMOD
2008
ACM
150views Database» more  SIGMOD 2008»
14 years 7 months ago
Ranking queries on uncertain data: a probabilistic threshold approach
Uncertain data is inherent in a few important applications such as environmental surveillance and mobile object tracking. Top-k queries (also known as ranking queries) are often n...
Ming Hua, Jian Pei, Wenjie Zhang, Xuemin Lin
SIGMOD
2007
ACM
229views Database» more  SIGMOD 2007»
14 years 7 months ago
Spark: top-k keyword query in relational databases
With the increasing amount of text data stored in relational databases, there is a demand for RDBMS to support keyword queries over text data. As a search result is often assemble...
Yi Luo, Xuemin Lin, Wei Wang 0011, Xiaofang Zhou
ICDE
2007
IEEE
113views Database» more  ICDE 2007»
14 years 2 months ago
Ranking Query Results using Context-Aware Preferences
To better serve users’ information needs without requiring comprehensive queries from users, a simple yet effective technique is to explore the preferences of users. Since these...
Arthur H. van Bunningen, Maarten M. Fokkinga, Pete...