Sciweavers

1033 search results - page 175 / 207
» A tightly coupled approach to design and data management
Sort
View
SSDBM
2002
IEEE
149views Database» more  SSDBM 2002»
15 years 2 months ago
A Cost Model for Interval Intersection Queries on RI-Trees
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
SIGMOD
2010
ACM
213views Database» more  SIGMOD 2010»
15 years 2 months ago
On active learning of record matching packages
We consider the problem of learning a record matching package (classifier) in an active learning setting. In active learning, the learning algorithm picks the set of examples to ...
Arvind Arasu, Michaela Götz, Raghav Kaushik
SAC
2000
ACM
15 years 2 months ago
The Evolution of the DARWIN System
DARWIN is a web-based system for presenting the results of wind-tunnel testing and computational model analyses to aerospace designers. DARWIN captures the data, maintains the inf...
Joan D. Walton, Robert E. Filman, David J. Korsmey...
DAWAK
1999
Springer
15 years 1 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 ...
CIDR
2009
159views Algorithms» more  CIDR 2009»
14 years 10 months ago
RIOT: I/O-Efficient Numerical Computing without SQL
R is a numerical computing environment that is widely popular for statistical data analysis. Like many such environments, R performs poorly for large datasets whose sizes exceed t...
Yi Zhang 0011, Herodotos Herodotou, Jun Yang 0001