Sciweavers

386 search results - page 30 / 78
» Probabilistic Ranking of Database Query Results
Sort
View
SIGMOD
2009
ACM
190views Database» more  SIGMOD 2009»
14 years 9 months ago
DataLens: making a good first impression
When a database query has a large number of results, the user can only be shown one page of results at a time. One popular approach is to rank results such that the "best&quo...
Bin Liu, H. V. Jagadish
ICDE
2000
IEEE
161views Database» more  ICDE 2000»
14 years 19 days ago
Efficient Query Refinement in Multimedia Databases
Increasing application demands are pushing database management systems (DBMSs) towards providing adequate and efficient support for content-based retrieval over multimedia objects...
Kaushik Chakrabarti, Kriengkrai Porkaew, Sharad Me...
SIGMOD
2007
ACM
172views Database» more  SIGMOD 2007»
14 years 9 months ago
Auditing disclosure by relevance ranking
Numerous widely publicized cases of theft and misuse of private information underscore the need for audit technology to identify the sources of unauthorized disclosure. We present...
Rakesh Agrawal, Alexandre V. Evfimievski, Jerry Ki...
SSDBM
2008
IEEE
113views Database» more  SSDBM 2008»
14 years 3 months ago
Query Selectivity Estimation for Uncertain Data
Applications requiring the handling of uncertain data have led to the development of database management systems extending the scope of relational databases to include uncertain (p...
Sarvjeet Singh, Chris Mayfield, Rahul Shah, Sunil ...
EDBT
2008
ACM
99views Database» more  EDBT 2008»
14 years 9 months ago
Querying time-series streams
Index trees created using distance based indexing are difficult to maintain online since the distance function involved is often costly to compute. This problem is intensified whe...
Vivekanand Gopalkrishnan