Sciweavers

736 search results - page 109 / 148
» Confidence-Aware Join Algorithms
Sort
View
SIGMOD
2001
ACM
136views Database» more  SIGMOD 2001»
14 years 10 months ago
Selectivity Estimation using Probabilistic Models
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
Lise Getoor, Benjamin Taskar, Daphne Koller
PEPM
2010
ACM
14 years 6 months ago
Optimizing relational algebra operations using generic equivalence discriminators and lazy products
We show how to efficiently evaluate generic map-filter-product queries, generalizations of select-project-join (SPJ) queries in relational algebra, based on a combination of two...
Fritz Henglein
CSCW
2010
ACM
14 years 6 months ago
Catchup: a useful application of time-travel in meetings
People are often required to catch up on information they have missed in meetings, because of lateness or scheduling conflicts. Catching up is a complex cognitive process where pe...
Simon Tucker, Ofer Bergman, Anand Ramamoorthy, Ste...
WWW
2008
ACM
14 years 10 months ago
Efficient vectorial operators for processing xml twig queries
This paper proposes several vectorial operators for processing XML twig queries, which are easy to be performed and inherently efficient for both Ancestor-Descendant (A-D) and Par...
Guoliang Li, Jianhua Feng, Jianyong Wang, Feng Lin...
RECOMB
2006
Springer
14 years 10 months ago
Maximal Accurate Forests from Distance Matrices
Abstract. We present a fast converging method for distance-based phylogenetic inference, which is novel in two respects. First, it is the only method (to our knowledge) to guarante...
Constantinos Daskalakis, Cameron Hill, Alexander J...