Sciweavers

181 search results - page 13 / 37
» Mining, indexing, and querying historical spatiotemporal dat...
Sort
View
DAWAK
1999
Springer
13 years 12 months ago
Implementation of Multidimensional Index Structures for Knowledge Discovery in Relational Databases
Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on efficient quer...
Stefan Berchtold, Christian Böhm, Hans-Peter ...
JIIS
2000
111views more  JIIS 2000»
13 years 7 months ago
Multidimensional Index Structures in Relational Databases
Abstract. Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on effi...
Christian Böhm, Stefan Berchtold, Hans-Peter ...
CORR
2008
Springer
114views Education» more  CORR 2008»
13 years 7 months ago
Dynamic index selection in data warehouses
Analytical queries defined on data warehouses are complex and use several join operations that are very costly, especially when run on very large data volumes. To improve response...
Stéphane Azefack, Kamel Aouiche, Jér...
SISAP
2008
IEEE
130views Data Mining» more  SISAP 2008»
14 years 2 months ago
The Many Facets of Approximate Similarity Search
In this article, we review the major paradigms for approximate similarity queries and propose a classification schema that easily allows existing approaches to be compared along ...
Marco Patella, Paolo Ciaccia
IJOCI
2010
163views more  IJOCI 2010»
13 years 5 months ago
An Experimental Performance Comparison for Indexing Mobile Objects on the Plane
We present a time-efficient approach to index objects moving on the plane to efficiently answer range queries about their future positions. Each object is moving with non small ve...
Spyros Sioutas, George Papaloukopoulos, Kostas Tsi...