Sciweavers

IDEAS
1999
IEEE
166views Database» more  IDEAS 1999»
13 years 12 months ago
Recovery Protocols in Multi-Agent Probabilistic Reasoning Systems
In this paper, we introduce a probabilistic relational data model as the basis for developing multi-agent probabilistic reasoning systems. Since our model subsumes the traditional...
Cory J. Butz, S. K. Michael Wong
IDEAS
1999
IEEE
175views Database» more  IDEAS 1999»
13 years 12 months ago
A Parallel Scalable Infrastructure for OLAP and Data Mining
Decision support systems are important in leveraging information present in data warehouses in businesses like banking, insurance, retail and health-care among many others. The mu...
Sanjay Goil, Alok N. Choudhary
ADC
1999
Springer
97views Database» more  ADC 1999»
13 years 12 months ago
Pseudo-Naive Evaluation
We introduce pseudo-naive evaluation, a method for execution of mixed top-down/bottom-up logic programs and deductive databases. The method is intermediate in power between naive ...
Donald A. Smith, Mark Utting
ADC
1999
Springer
68views Database» more  ADC 1999»
13 years 12 months ago
A Query-sensitive Cost Model for Similarity Queries with M-tree
We introduce a cost model for the M-tree access method [Ciaccia et al., 1997] which provides estimates of CPU (distance computations) and I/O costs for the execution of similarity ...
Paolo Ciaccia, A. Nanni, Marco Patella
ADC
1999
Springer
90views Database» more  ADC 1999»
13 years 12 months ago
Object Placement in Parallel OODBMS
Z. He, Jeffrey Xu Yu
ADBIS
1999
Springer
104views Database» more  ADBIS 1999»
13 years 12 months ago
Mining Various Patterns in Sequential Data in an SQL-like Manner
Abstract. One of the most important data mining tasks is discovery of frequently occurring patterns in sequences of events. Many algorithms for finding various patterns in sequenti...
Marek Wojciechowski
ADBIS
1999
Springer
98views Database» more  ADBIS 1999»
13 years 12 months ago
Processing of Spatio-Temporal Queries in Image Databases
Abstract. Overlapping Linear Quadtrees is a structure suitable for storing consecutive raster images according to transaction time (a database of evolving images). This structure s...
Theodoros Tzouramanis, Michael Vassilakopoulos, Ya...
ADBIS
1999
Springer
104views Database» more  ADBIS 1999»
13 years 12 months ago
Arbiter Meta-Learning with Dynamic Selection of Classifiers and Its Experimental Investigation
In data mining, the selection of an appropriate classifier to estimate the value of an unknown attribute for a new instance has an essential impact to the quality of the classifica...
Alexey Tsymbal, Seppo Puuronen, Vagan Y. Terziyan
ADBIS
1999
Springer
80views Database» more  ADBIS 1999»
13 years 12 months ago
S*-Tree: An Improved S+-Tree for Coloured Images
In this paper we propose and analyze a new spatial access method, namely the S∗ -tree, for the efficient secondary memory encoding and manipulation of images containing multiple ...
Enrico Nardelli, Guido Proietti