Sciweavers

721 search results - page 15 / 145
» Supporting top-k join queries in relational databases
Sort
View
ICDE
1995
IEEE
139views Database» more  ICDE 1995»
15 years 11 months ago
Set-Oriented Mining for Association Rules in Relational Databases
We describe set-oriented algorithms for mining association rules. Such algorithms imply performing multiple joins and may appear to be inherently less escient than special-purpose...
Maurice A. W. Houtsma, Arun N. Swami
FQAS
2006
Springer
186views Database» more  FQAS 2006»
15 years 1 months ago
Project-Join-Repair: An Approach to Consistent Query Answering Under Functional Dependencies
Consistent query answering is the term commonly used for the problem of answering queries on databases that violate certain integrity constraints. We address this problem for univ...
Jef Wijsen
ICDM
2002
IEEE
163views Data Mining» more  ICDM 2002»
15 years 2 months ago
High Performance Data Mining Using the Nearest Neighbor Join
The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such that the r...
Christian Böhm, Florian Krebs
SIGMOD
1999
ACM
98views Database» more  SIGMOD 1999»
15 years 1 months ago
Integration of Spatial Join Algorithms for Processing Multiple Inputs
Several techniques that compute the join between two spatial datasets have been proposed during the last decade. Among these methods, some consider existing indices for the joined...
Nikos Mamoulis, Dimitris Papadias
CORR
2011
Springer
181views Education» more  CORR 2011»
14 years 1 months ago
SmartInt: Using Mined Attribute Dependencies to Integrate Fragmented Web Databases
Many web databases can be seen as providing partial and overlapping information about entities in the world. To answer queries effectively, we need to integrate the information ab...
Ravi Gummadi, Anupam Khulbe, Aravind Kalavagattu, ...