Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleJune 2002
- ArticleJune 2002
HD-Eye: visual clustering of high dimensional data
SIGMOD '02: Proceedings of the 2002 ACM SIGMOD international conference on Management of dataPage 629https://doi.org/10.1145/564691.564784Clustering of large data bases is an important research area with a large variety of applications in the data base context. Missing in most of the research efforts are means for guiding the clustering process and understanding the results, which is ...
- ArticleJune 2002
CubeExplorer: online exploration of data cubes
SIGMOD '02: Proceedings of the 2002 ACM SIGMOD international conference on Management of dataPage 626https://doi.org/10.1145/564691.564781Data cube enables fast online analysis of large data repositories which is attractive in many applications. Although there are several kinds of available cube-based OLAP products, users may still encounter challenges on effectiveness and efficiency in ...
- ArticleJune 2002
Learning table access cardinalities with LEO
SIGMOD '02: Proceedings of the 2002 ACM SIGMOD international conference on Management of dataPage 613https://doi.org/10.1145/564691.564766LEO is a comprehensive way to repair incorrect statistics and cardinality estimates of a query execution plan. LEO introduces a feedback loop to query optimization that enhances the available information on the database where the most queries have ...
- ArticleJune 2002
Mid-tier caching: the TimesTen approach
SIGMOD '02: Proceedings of the 2002 ACM SIGMOD international conference on Management of dataPages 588–593https://doi.org/10.1145/564691.564761TimesTen is an in-memory, application-tier data manager that delivers low response time and high throughput. Applications may create tables and manage them exclusively in TimesTen, and they may optionally cache frequently used subsets of a disk-based ...
- ArticleJune 2002
Automating physical database design in a parallel database
SIGMOD '02: Proceedings of the 2002 ACM SIGMOD international conference on Management of dataPages 558–569https://doi.org/10.1145/564691.564757Physical database design is important for query performance in a shared-nothing parallel database system, in which data is horizontally partitioned among multiple independent nodes. We seek to automate the process of data partitioning. Given a workload ...
- ArticleJune 2002
Garlic: a new flavor of federated query processing for DB2
SIGMOD '02: Proceedings of the 2002 ACM SIGMOD international conference on Management of dataPages 524–532https://doi.org/10.1145/564691.564751In a large modern enterprise, information is almost inevitably distributed among several database management systems. Despite considerable attention from the research community, relatively few commercial systems have attempted to address this issue. ...
- ArticleJune 2002
Coordinating backup/recovery and data consistency between database and file systems
SIGMOD '02: Proceedings of the 2002 ACM SIGMOD international conference on Management of dataPages 500–511https://doi.org/10.1145/564691.564749Managing a combined store consisting of database data and file data in a robust and consistent manner is a challenge for database systems and content management systems. In such a hybrid system, images, videos, engineering drawings, etc. are stored as ...
- ArticleJune 2002
Compressing SQL workloads
SIGMOD '02: Proceedings of the 2002 ACM SIGMOD international conference on Management of dataPages 488–499https://doi.org/10.1145/564691.564747Recently several important relational database tasks such as index selection, histogram tuning, approximate query processing, and statistics selection have recognized the importance of leveraging workloads. Often these tasks are presented with large ...
- ArticleJune 2002
Dwarf: shrinking the PetaCube
SIGMOD '02: Proceedings of the 2002 ACM SIGMOD international conference on Management of dataPages 464–475https://doi.org/10.1145/564691.564745Dwarf is a highly compressed structure for computing, storing, and querying data cubes. Dwarf identifies prefix and suffix structural redundancies and factors them out by coalescing their store. Prefix redundancy is high on dense areas of cubes but ...
- ArticleJune 2002
Hierarchical subspace sampling: a unified framework for high dimensional data reduction, selectivity estimation and nearest neighbor search
SIGMOD '02: Proceedings of the 2002 ACM SIGMOD international conference on Management of dataPages 452–463https://doi.org/10.1145/564691.564743With the increased abilities for automated data collection made possible by modern technology, the typical sizes of data collections have continued to grow in recent years. In such cases, it may be desirable to store the data in a reduced format in ...
- ArticleJune 2002
Mining database structure; or, how to build a data quality browser
SIGMOD '02: Proceedings of the 2002 ACM SIGMOD international conference on Management of dataPages 240–251https://doi.org/10.1145/564691.564719Data mining research typically assumes that the data to be analyzed has been identified, gathered, cleaned, and processed into a convenient form. While data mining tools greatly enhance the ability of the analyst to make data-driven discoveries, most of ...
- ArticleJune 2002
Storing and querying ordered XML using a relational database system
SIGMOD '02: Proceedings of the 2002 ACM SIGMOD international conference on Management of dataPages 204–215https://doi.org/10.1145/564691.564715XML is quickly becoming the de facto standard for data exchange over the Internet. This is creating a new set of data management requirements involving XML, such as the need to store and query XML documents. Researchers have proposed using relational ...
- ArticleJune 2002
StatiX: making XML count
SIGMOD '02: Proceedings of the 2002 ACM SIGMOD international conference on Management of dataPages 181–191https://doi.org/10.1145/564691.564713The availability of summary data for XML documents has many applications, from providing users with quick feedback about their queries, to cost-based storage design and query optimization. StatiX is a novel XML Schema-aware statistics framework that ...
- ArticleJune 2002
Covering indexes for branching path queries
SIGMOD '02: Proceedings of the 2002 ACM SIGMOD international conference on Management of dataPages 133–144https://doi.org/10.1145/564691.564707In this paper, we ask if the traditional relational query acceleration techniques of summary tables and covering indexes have analogs for branching path expression queries over tree- or graph-structured XML data. Our answer is yes --- the forward-and-...
- ArticleJune 2002
Continuously adaptive continuous queries over streams
SIGMOD '02: Proceedings of the 2002 ACM SIGMOD international conference on Management of dataPages 49–60https://doi.org/10.1145/564691.564698We present a continuously adaptive, continuous query (CACQ) implementation based on the eddy query processing framework. We show that our design provides significant performance benefits over existing approaches to evaluating continuous queries, not ...
- ArticleJune 2002
Rate-based query optimization for streaming information sources
SIGMOD '02: Proceedings of the 2002 ACM SIGMOD international conference on Management of dataPages 37–48https://doi.org/10.1145/564691.564697Relational query optimizers have traditionally relied upon table cardinalities when estimating the cost of the query plans they consider. While this approach has been and continues to be successful, the advent of the Internet and the need to execute ...
- proceedingJune 2002
SIGMOD '02: Proceedings of the 2002 ACM SIGMOD international conference on Management of data
The 2002 ACM SIGMOD International Conference on Management of Data, was held June 4-6, 2002 at the spectacular Frank Lloyd Wright-designed Monona Terrace conference center in Madison, Wisconsin. The SIGMOD conference has long held its status a leading ...