Sciweavers

912 search results - page 15 / 183
» Inductive Databases as Ranking
Sort
View
SIGMOD
2008
ACM
150views Database» more  SIGMOD 2008»
14 years 7 months ago
DB&IR integration: report on the Dagstuhl seminar "ranked XML querying"
Sihem Amer-Yahia, Djoerd Hiemstra, Thomas Roelleke...
CIKM
2010
Springer
13 years 5 months ago
Probabilistic ranking for relational databases based on correlations
This paper proposes a ranking method to exploit statistical correlations among pairs of attribute values in relational databases. For a given query, the correlations of the query ...
Jaehui Park, Sang-goo Lee
ICDE
2005
IEEE
133views Database» more  ICDE 2005»
14 years 9 months ago
Efficient Inverted Lists and Query Algorithms for Structured Value Ranking in Update-Intensive Relational Databases
We propose a new ranking paradigm for relational databases called Structured Value Ranking (SVR). SVR uses structured data values to score (rank) the results of keyword search que...
Lin Guo, Jayavel Shanmugasundaram, Kevin S. Beyer,...
EDBT
2008
ACM
180views Database» more  EDBT 2008»
14 years 7 months ago
Probabilistic ranked queries in uncertain databases
Recently, many new applications, such as sensor data monitoring and mobile device tracking, raise up the issue of uncertain data management. Compared to "certain" data, ...
Xiang Lian, Lei Chen 0002
SCCC
1997
IEEE
13 years 11 months ago
Reactive Ranking for Cooperative Databases
A cooperative database allows the user to specify approximate or vague query conditions. A vague query requires the database system to rank the retrieved answers according to thei...
Berthier A. Ribeiro-Neto, Guilherme T. de Assis