Sciweavers

3420 search results - page 362 / 684
» Proximity Search in Databases
Sort
View
ICDE
2003
IEEE
155views Database» more  ICDE 2003»
16 years 8 months ago
XR-Tree: Indexing XML Data for Efficient Structural Joins
XML documents are typically queried with a combination of value search and structure search. While querying by values can leverage traditional database technologies, evaluating st...
Haifeng Jiang, Hongjun Lu, Wei Wang 0011, Beng Chi...
SIGMOD
2001
ACM
193views Database» more  SIGMOD 2001»
16 years 6 months ago
Epsilon Grid Order: An Algorithm for the Similarity Join on Massive High-Dimensional Data
The similarity join is an important database primitive which has been successfully applied to speed up applications such as similarity search, data analysis and data mining. The s...
Christian Böhm, Bernhard Braunmüller, Fl...
SISAP
2009
IEEE
122views Data Mining» more  SISAP 2009»
16 years 1 months ago
Dynamic Spatial Approximation Trees for Massive Data
—Metric space searching is an emerging technique to address the problem of efficient similarity searching in many applications, including multimedia databases and other reposito...
Gonzalo Navarro, Nora Reyes
ICDE
2007
IEEE
179views Database» more  ICDE 2007»
16 years 1 months ago
A New ILP-based Concept Discovery Method for Business Intelligence
In this work, we propose a multi-relational concept discovery method for business intelligence applications. Multi-relational data mining finds interesting patterns that span ove...
Seda Daglar Toprak, Pinar Senkul, Yusuf Kavurucu, ...
SSD
2007
Springer
124views Database» more  SSD 2007»
16 years 23 days ago
Querying Objects Modeled by Arbitrary Probability Distributions
In many modern applications such as biometric identification systems, sensor networks, medical imaging, geology, and multimedia databases, the data objects are not described exact...
Christian Böhm, Peter Kunath, Alexey Pryakhin...