Sciweavers

808 search results - page 49 / 162
» On the Estimation of Join Result Sizes
Sort
View
SIGMOD
2012
ACM
276views Database» more  SIGMOD 2012»
13 years 3 months ago
SCARAB: scaling reachability computation on large graphs
Most of the existing reachability indices perform well on small- to medium- size graphs, but reach a scalability bottleneck around one million vertices/edges. As graphs become inc...
Ruoming Jin, Ning Ruan, Saikat Dey, Jeffrey Xu Yu
105
Voted
ALMOB
2006
80views more  ALMOB 2006»
15 years 23 days ago
Pattern statistics on Markov chains and sensitivity to parameter estimation
Background: In order to compute pattern statistics in computational biology a Markov model is commonly used to take into account the sequence composition. Usually its parameter mu...
Grégory Nuel
146
Voted
DBPL
2003
Springer
144views Database» more  DBPL 2003»
15 years 6 months ago
A General Framework for Estimating XML Query Cardinality
Abstract. In the context of XML data management systems, the estimation of query cardinality is becoming more and more important: the information provided by a query result estimat...
Carlo Sartiani
107
Voted
ICDE
2009
IEEE
184views Database» more  ICDE 2009»
15 years 7 months ago
Scalable Keyword Search on Large Data Streams
Abstract— It is widely realized that the integration of information retrieval (IR) and database (DB) techniques provides users with a broad range of high quality services. A new ...
Lu Qin, Jeffrey Xu Yu, Lijun Chang, Yufei Tao
COMPGEOM
2006
ACM
15 years 4 months ago
I/O-efficient batched union-find and its applications to terrain analysis
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
Pankaj K. Agarwal, Lars Arge, Ke Yi