Sciweavers

333 search results - page 20 / 67
» Read-Once Functions and Query Evaluation in Probabilistic Da...
Sort
View
191
Voted
SIGMOD
2005
ACM
100views Database» more  SIGMOD 2005»
16 years 3 months ago
A Disk-Based Join With Probabilistic Guarantees
One of the most common operations in analytic query processing is the application of an aggregate function to the result of a relational join. We describe an algorithm for computi...
Chris Jermaine, Alin Dobra, Subramanian Arumugam, ...
113
Voted
SPIRE
2010
Springer
15 years 1 months ago
Hypergeometric Language Model and Zipf-Like Scoring Function for Web Document Similarity Retrieval
The retrieval of similar documents in the Web from a given document is different in many aspects from information retrieval based on queries generated by regular search engine use...
Felipe Bravo-Marquez, Gaston L'Huillier, Sebasti&a...
ICDT
2009
ACM
166views Database» more  ICDT 2009»
16 years 4 months ago
A compositional framework for complex queries over uncertain data
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
Christoph Koch, Michaela Götz
ICDT
2010
ACM
147views Database» more  ICDT 2010»
15 years 6 months ago
Querying Parse Trees of Stochastic Context-Free Grammars
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
Sara Cohen, Benny Kimelfeld
WWW
2005
ACM
16 years 4 months ago
Executing incoherency bounded continuous queries at web data aggregators
Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of some ...
Rajeev Gupta, Ashish Puri, Krithi Ramamritham