Sciweavers

2656 search results - page 259 / 532
» Compacting XML Data
Sort
View
126
Voted
EDBT
2002
ACM
132views Database» more  EDBT 2002»
16 years 4 months ago
A Framework for the Physical Design Problem for Data Synopses
Maintaining statistics on multidimensional data distributions is crucial for predicting the run-time and result size of queries and data analysis tasks with acceptable accuracy. To...
Arnd Christian König, Gerhard Weikum
CC
2007
Springer
208views System Software» more  CC 2007»
15 years 10 months ago
A New Elimination-Based Data Flow Analysis Framework Using Annotated Decomposition Trees
Abstract. We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n2 ...
Bernhard Scholz, Johann Blieberger
134
Voted
ICDM
2002
IEEE
114views Data Mining» more  ICDM 2002»
15 years 9 months ago
Online Algorithms for Mining Semi-structured Data Stream
In this paper, we study an online data mining problem from streams of semi-structured data such as XML data. Modeling semi-structured data and patterns as labeled ordered trees, w...
Tatsuya Asai, Hiroki Arimura, Kenji Abe, Shinji Ka...
SIGMOD
1999
ACM
138views Database» more  SIGMOD 1999»
15 years 8 months ago
Storing Semistructured Data with STORED
Systems for managing and querying semistructured-data sources often store data in proprietary object repositories or in a tagged-text format. We describe a technique that can use ...
Alin Deutsch, Mary F. Fernández, Dan Suciu
ICPR
2002
IEEE
16 years 5 months ago
Data Clustering Using Evidence Accumulation
We explore the idea of evidence accumulation for combining the results of multiple clusterings. Initially, n d-dimensional data is decomposed into a large number of compact cluste...
Ana L. N. Fred, Anil K. Jain