Sciweavers

385 search results - page 20 / 77
» Probabilistic ranking over relations
Sort
View
ICDE
2003
IEEE
145views Database» more  ICDE 2003»
14 years 9 months ago
PXML: A Probabilistic Semistructured Data Model and Algebra
Despite the recent proliferation of work on semistructured data models, there has been little work to date on supporting uncertainty in these models. In this paper, we propose a m...
Edward Hung, Lise Getoor, V. S. Subrahmanian
INEX
2004
Springer
14 years 1 months ago
Component Ranking and Automatic Query Refinement for XML Retrieval
Queries over XML documents challenge search engines to return the most relevant XML components that satisfy the query concepts. In a previous work[6] we described an algorithm to ...
Yosi Mass, Matan Mandelbrod
PODS
2012
ACM
276views Database» more  PODS 2012»
11 years 10 months ago
Randomized algorithms for tracking distributed count, frequencies, and ranks
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
Zengfeng Huang, Ke Yi, Qin Zhang
SIGMOD
2011
ACM
176views Database» more  SIGMOD 2011»
12 years 10 months ago
Sharing work in keyword search over databases
An important means of allowing non-expert end-users to pose ad hoc queries — whether over single databases or data integration systems — is through keyword search. Given a set...
Marie Jacob, Zachary G. Ives
SIGMOD
2005
ACM
107views Database» more  SIGMOD 2005»
14 years 7 months ago
Relational Confidence Bounds Are Easy With The Bootstrap
Statistical estimation and approximate query processing have become increasingly prevalent applications for database systems. However, approximation is usually of little use witho...
Abhijit Pol, Chris Jermaine