Sciweavers

1091 search results - page 16 / 219
» Approximation in Databases
Sort
View
ICDE
1998
IEEE
108views Database» more  ICDE 1998»
14 years 9 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 ...
FQAS
2009
Springer
127views Database» more  FQAS 2009»
14 years 3 months ago
Finding Top-k Approximate Answers to Path Queries
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...
DATAMINE
2006
142views more  DATAMINE 2006»
13 years 8 months ago
Sequential Pattern Mining in Multi-Databases via Multiple Alignment
To efficiently find global patterns from a multi-database, information in each local database must first be mined and summarized at the local level. Then only the summarized infor...
Hye-Chung Kum, Joong Hyuk Chang, Wei Wang 0010
SSDBM
2003
IEEE
164views Database» more  SSDBM 2003»
14 years 1 months ago
Approximate String Joins
String data is ubiquitous, and its management has taken on particular importance in the past few years. Approximate queries are very important on string data especially for more c...
Divesh Srivastava
EDBT
2002
ACM
129views Database» more  EDBT 2002»
14 years 8 months ago
Schema-Driven Evaluation of Approximate Tree-Pattern Queries
Abstract. We present a simple query language for XML, which supports hierarchical, Boolean-connected query patterns. The interpretation of a query is founded on cost-based query tr...
Torsten Schlieder