Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleAugust 2004
AIDA: an adaptive immersive data analyzer
VLDB '04: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30August 2004, Pages 1369–1372In this demonstration, we show various querying capabilities of an application called AIDA. AIDA is developed to help the study of attention disorder in kids. In a different study [1], we collected several immresive sensory data streams from kids ...
- ArticleAugust 2004
- ArticleAugust 2004
SVT: schema validation tool for microsoft SQL-server
VLDB '04: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30August 2004, Pages 1349–1352We present SVT, a tool for validating database schemas in SQL Server. This is done by means of testing desirable properties that a database schema should satisfy. To our knowledge, no commercial relational DBMS provides yet a tool able to perform such ...
- ArticleAugust 2004
Progressive optimization in action
VLDB '04: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30August 2004, Pages 1337–1340Progressive Optimization (POP) is a technique to make query plans robust, and minimize need for DBA intervention, by repeatedly re-optimizing a query during runtime if the cardinalities estimated during optimization prove to be significantly incorrect. ...
- ArticleAugust 2004
Green query optimization: taming query optimization overheads through plan recycling
VLDB '04: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30August 2004, Pages 1333–1336PLASTIC [1] is a recently-proposed tool to help query optimizers significantly amortize optimization overheads through a technique of plan recycling. The tool groups similar queries into clusters and uses the optimizer-generated plan for the cluster ...
-
- ArticleAugust 2004
High performance index build algorithms for intranet search engines
VLDB '04: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30August 2004, Pages 1122–1133There has been a substantial amount of research on high-performance algorithms for constructing an inverted text index. However, constructing the inverted index in a intranet search engine is only the final step in a more complicated index build ...
- ArticleAugust 2004
Automatic SQL tuning in oracle 10g
VLDB '04: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30August 2004, Pages 1098–1109SQL tuning is a very critical aspect of database performance tuning. It is an inherently complex activity requiring a high level of expertise in several domains: query optimization, to improve the execution plan selected by the query optimizer; access ...
- ArticleAugust 2004
DB2 design advisor: integrated automatic physical database design
VLDB '04: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30August 2004, Pages 1087–1097The DB2 Design Advisor in IBM® DB2® Universal DatabaseTM (DB2 UDB) Version 8.2 for Linux®, UNIX® and Windows® is a tool that, for a given workload, automatically recommends physical design features that are any subset of indexes, materialized query ...
- ArticleAugust 2004
BioPatentMiner: an information retrieval system for biomedical patents
VLDB '04: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30August 2004, Pages 1066–1077Before undertaking new biomedical research, identifying concepts that have already been patented is essential. Traditional keyword based search on patent databases may not be sufficient to retrieve all the relevant information, especially for the ...
- ArticleAugust 2004
Generating thousand benchmark queries in seconds
VLDB '04: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30August 2004, Pages 1045–1053The combination of an exponential growth in the amount of data managed by a typical business intelligence system and the increased competitiveness of a global economy has propelled decision support systems (DSS) from the role of exploratory tools ...
- ArticleAugust 2004
P*TIME: highly scalable OLTP DBMS for managing update-intensive stream workload
VLDB '04: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30August 2004, Pages 1033–1044Over the past thirty years since the system R and Ingres projects started to lay the foundation for today's RDBMS implementations, the underlying hardware and software platforms have changed dramatically. However, the fundamental RDBMS architecture, ...
- ArticleAugust 2004
PIVOT and UNPIVOT: optimization and execution strategies in an RDBMS
VLDB '04: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30August 2004, Pages 998–1009PIVOT and UNPIVOT, two operators on tabular data that exchange rows and columns, enable data transformations useful in data modeling, data analysis, and data presentation. They can quite easily be implemented inside a query processor, much like select, ...
- ArticleAugust 2004
Returning modified rows - select statements with side effects
VLDB '04: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30August 2004, Pages 987–997SQL in the IBM® DB2® Universal DatabaseTM for Linux®, UNIX®, and Windows® (DB2 UDB) database management product has been extended to support nested INSERT, UPDATE, and DELETE operations in SELECT statements. This allows database applications additional ...
- ArticleAugust 2004
The case for precision sharing
VLDB '04: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30August 2004, Pages 972–984Sharing has emerged as a key idea of static and adaptive stream query processing systems. Inherent in these systems is a tension between sharing common work and avoiding unnecessary work. Increased sharing has generally led to more unnecessary work.
Our ...
- ArticleAugust 2004
A combined framework for grouping and order optimization
VLDB '04: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30August 2004, Pages 960–971Since the introduction of cost-based query optimization by Selinger et al. in their seminal paper, the performance-critical role of interesting orders has been recognized. Some algebraic operators change interesting orders (e.g. sort and select), while ...
- ArticleAugust 2004
Lifting the burden of history from adaptive query processing
VLDB '04: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30August 2004, Pages 948–959Adaptive query processing schemes attempt to re-optimize query plans during the course of query execution. A variety of techniques for adaptive query processing have been proposed, varying in the granularity at which they can make decisions [8]. The ...
- ArticleAugust 2004
Multi-objective query processing for database systems
VLDB '04: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30August 2004, Pages 936–947Query processing in database systems has developed beyond mere exact matching of attribute values. Scoring database objects and retrieving only the top k matches or Pareto-optimal result sets (skyline queries) are already common for a variety of ...
- ArticleAugust 2004
Algebraic manipulation of scientific datasets
VLDB '04: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30August 2004, Pages 924–935We investigate algebraic processing strategies for large numeric datasets equipped with a possibly irregular grid structure. Such datasets arise, for example, in computational simulations, observation networks, medical imaging, and 2-D and 3-D rendering. ...
- ArticleAugust 2004
An annotation management system for relational databases
VLDB '04: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30August 2004, Pages 900–911We present an annotation management system for relational databases. In this system, every piece of data in a relation is assumed to have zero or more annotations associated with it and annotations are propagated along, from the source to the output, as ...