Sciweavers

7593 search results - page 1295 / 1519
» Querying XML Databases
Sort
View
KDD
1995
ACM
148views Data Mining» more  KDD 1995»
15 years 8 months ago
Learning Arbiter and Combiner Trees from Partitioned Data for Scaling Machine Learning
Knowledge discovery in databases has become an increasingly important research topic with the advent of wide area network computing. One of the crucial problems we study in this p...
Philip K. Chan, Salvatore J. Stolfo
ICDE
1987
IEEE
81views Database» more  ICDE 1987»
15 years 8 months ago
Multidimensional Dynamic Quantile Hashing is Very Efficient for Non-Uniform Record Distributions
: Previous multidimensional dynamic hashing schemes exhibit two obvious shortcomings. First, even for uniform record distribution, the retrieval performance of these schemes suffer...
Hans-Peter Kriegel, Bernhard Seeger
DEXA
2005
Springer
111views Database» more  DEXA 2005»
15 years 6 months ago
On the General Signature Trees
The signature file method is a popular indexing technique used in information retrieval and databases. It excels in efficient index maintenance and lower space overhead. Different ...
Yangjun Chen
CIDR
2007
101views Algorithms» more  CIDR 2007»
15 years 6 months ago
The Data Ring: Community Content Sharing
Information ubiquity has created a large crowd of users (most notably scientists), who could employ DBMS technology to process and share their data more effectively. Still, this ...
Serge Abiteboul, Neoklis Polyzotis
WDAS
1998
15 years 5 months ago
Data Replication and Delay Balancing in Heterogeneous Disk Systems
Declustering and replication are well known techniques used to improve response time of queries in parallel disk environments. As data replication incurs a penalty for updates, da...
Doron Rotem, Sridhar Seshadri, Luis M. Bernardo
« Prev « First page 1295 / 1519 Last » Next »