Sciweavers

4541 search results - page 162 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
ICDE
2002
IEEE
121views Database» more  ICDE 2002»
16 years 4 months ago
Similarity Flooding: A Versatile Graph Matching Algorithm and Its Application to Schema Matching
Matching elements of two data schemas or two data instances plays a key role in data warehousing, e-business, or even biochemical applications. In this paper we present a matching...
Sergey Melnik, Hector Garcia-Molina, Erhard Rahm
DEXA
2003
Springer
135views Database» more  DEXA 2003»
15 years 8 months ago
On the Optimality of Holistic Algorithms for Twig Queries
Streaming XML documents has many emerging applications. However, in this paper, we show that the restrictions imposed by data streaming are too restrictive for processing twig quer...
Byron Choi, Malika Mahoui, Derick Wood
CORR
2008
Springer
143views Education» more  CORR 2008»
15 years 3 months ago
Join Bayes Nets: A new type of Bayes net for relational data
Many real-world data are maintained in relational format, with different tables storing information about entities and their links or relationships. The structure (schema) of the ...
Oliver Schulte, Hassan Khosravi, Flavia Moser, Mar...
VLDB
1999
ACM
89views Database» more  VLDB 1999»
15 years 7 months ago
Physical Data Independence, Constraints, and Optimization with Universal Plans
We present an optimization method and algorithm designed for three objectives: physical data independence, semantic optimization, and generalized tableau minimization. The method ...
Alin Deutsch, Lucian Popa, Val Tannen
FIMI
2003
88views Data Mining» more  FIMI 2003»
15 years 4 months ago
A fast APRIORI implementation
The efficiency of frequent itemset mining algorithms is determined mainly by three factors: the way candidates are generated, the data structure that is used and the implementati...
Ferenc Bodon