Sciweavers

2853 search results - page 314 / 571
» On the Efficiency of Provenance Queries
Sort
View
ICDE
1998
IEEE
108views Database» more  ICDE 1998»
16 years 8 months ago
Efficient Discovery of Functional and Approximate Dependencies Using Partitions
Discovery of functionaldependencies from relations has been identified as an important database analysis technique. In this paper, we present a new approach for finding functional...
Ykä Huhtala, Juha Kärkkäinen, Pasi ...
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
16 years 6 months ago
Robust and efficient algorithms for rank join evaluation
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
Jonathan Finger, Neoklis Polyzotis
SIGMOD
2008
ACM
191views Database» more  SIGMOD 2008»
16 years 6 months ago
Efficient aggregation for graph summarization
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
Yuanyuan Tian, Richard A. Hankins, Jignesh M. Pate...
SIGMOD
2006
ACM
116views Database» more  SIGMOD 2006»
16 years 6 months ago
Fast range-summable random variables for efficient aggregate estimation
Exact computation for aggregate queries usually requires large amounts of memory ? constrained in data-streaming ? or communication ? constrained in distributed computation ? and ...
Florin Rusu, Alin Dobra
ANCS
2005
ACM
16 years 7 days ago
Segmented hash: an efficient hash table implementation for high performance networking subsystems
Hash tables provide efficient table implementations, achieving O(1), query, insert and delete operations at low loads. However, at moderate or high loads collisions are quite freq...
Sailesh Kumar, Patrick Crowley