Sciweavers

7576 search results - page 1282 / 1516
» On Querying Ontologies and Databases
Sort
View
DEXA
2006
Springer
121views Database» more  DEXA 2006»
15 years 10 months ago
DCF: An Efficient Data Stream Clustering Framework for Streaming Applications
Streaming applications, such as environment monitoring and vehicle location tracking require handling high volumes of continuously arriving data and sudden fluctuations in these vo...
Kyungmin Cho, SungJae Jo, Hyukjae Jang, Su Myeon K...
ER
2006
Springer
123views Database» more  ER 2006»
15 years 10 months ago
A Quantitative Summary of XML Structures
Statistical summaries in relational databases mainly focus on the distribution of data values and have been found useful for various applications, such as query evaluation and data...
Zi Lin, Bingsheng He, Byron Choi
ADBIS
2000
Springer
117views Database» more  ADBIS 2000»
15 years 10 months ago
Multiversion Linear Quadtree for Spatio-Temporal Data
Research in spatio-temporal databases has largely focused on extensions of access methods for the proper handling of time changing spatial information. In this paper, we present th...
Theodoros Tzouramanis, Michael Vassilakopoulos, Ya...
KDD
1995
ACM
148views Data Mining» more  KDD 1995»
15 years 10 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 10 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
« Prev « First page 1282 / 1516 Last » Next »