• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 4,860
Next 10 →

Query Execution

by A. Böhm, M. Brantner, C-c. Kanne, N. May, G. Moerkotte
"... Abstract. We present the architecture of Natix V2. Among the features of this native XML Data Store are an optimizing XPath query compiler and a powerful API. In our demonstration we explain this API and present XPath evaluation in Natix using its visual explain facilities. 1 The Natix System The Na ..."
Abstract - Add to MetaCart
The Natix Project [3] was among the first to realize the idea of a native XML Data Store (XDS), which supports XML processing down to the deep levels of storage and query execution engine. Such native XDSs are now also being introduced by major database vendors [1]. Natix Version 2.0 provides most features

The CQL Continuous Query Language: Semantic Foundations and Query Execution

by Arvind Arasu, Shivnath Babu, Jennifer Widom - VLDB Journal , 2003
"... CQL, a Continuous Query Language, is supported by the STREAM prototype Data Stream Management System at Stanford. CQL is an expressive SQL-based declarative language for registering continuous queries against streams and updatable relations. We begin by presenting an abstract semantics that relie ..."
Abstract - Cited by 354 (4 self) - Add to MetaCart
CQL, a Continuous Query Language, is supported by the STREAM prototype Data Stream Management System at Stanford. CQL is an expressive SQL-based declarative language for registering continuous queries against streams and updatable relations. We begin by presenting an abstract semantics

Visualizing the robustness of query execution

by Goetz Graefe, Harumi Kuno, Janet L. Wiener
"... In database query processing, actual run-time conditions (e.g., actual selectivities and actual available memory) very often differ from compile-time expectations of run-time conditions (e.g., estimated predicate selectivities and anticipated memory availability). Robustness of query processing can ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
be defined as the ability to handle unexpected conditions. Robustness of query execution, specifically, can be defined as the ability to process a specific plan efficiently in an unexpected condition. We focus on query execution (runtime), ignoring query optimization (compile-time), in order to complement

An Adaptive Query Execution System for Data Integration

by Zachary Ives, Daniela Florescu, Inria Roquencourt, Marc Friedman, Alon Levy, Daniel Weld , 1999
"... Query processing in data integration occurs over networkbound, autonomous data sources. This requires extensions to traditional optimization and execution techniques for three reasons: there is an absence of quality statistics about the data, data transfer rates are unpredictable and bursty, and slo ..."
Abstract - Cited by 226 (21 self) - Add to MetaCart
Query processing in data integration occurs over networkbound, autonomous data sources. This requires extensions to traditional optimization and execution techniques for three reasons: there is an absence of quality statistics about the data, data transfer rates are unpredictable and bursty

Query Execution Assurance for Outsourced Databases

by Radu Sion , 2005
"... In this paper we propose and analyze a method for proofs of actual query execution in an outsourced database framework, in which a client outsources its data management needs to a specialized provider. The solution is not limited to simple selection predicate queries but handles arbitrary quer ..."
Abstract - Cited by 74 (4 self) - Add to MetaCart
In this paper we propose and analyze a method for proofs of actual query execution in an outsourced database framework, in which a client outsources its data management needs to a specialized provider. The solution is not limited to simple selection predicate queries but handles arbitrary

Efficient Query Execution on . . .

by Susanne Hambrusch , Chuan-ming Liu , Walid G. Aref , Sunil Prabhakar , 2007
"... ..."
Abstract - Add to MetaCart
Abstract not found

Profiling the Predator Query Execution Engine

by Bjarke Buur Mortensen , 2002
"... Predator is a freely available database system. This paper studies the performance of the Predator query execution engine using high-level and low-level profiling. We describe the aspects of running database systems on modern processors and the tools available for investigating how these aspects inf ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Predator is a freely available database system. This paper studies the performance of the Predator query execution engine using high-level and low-level profiling. We describe the aspects of running database systems on modern processors and the tools available for investigating how these aspects

An extensible query execution engine for supporting new query execution models

by Fausto Ayres, Fabio Porto, Rubens Melo , 2005
"... Abstract. Query processing in traditional Database Management Systems (DBMS) has been extensively studied in the literature and adopted in industry. Such success is, in part, due to the performance of their Query Execution Engines (QEE) for supporting the execution of traditional queries. With the a ..."
Abstract - Cited by 5 (4 self) - Add to MetaCart
Abstract. Query processing in traditional Database Management Systems (DBMS) has been extensively studied in the literature and adopted in industry. Such success is, in part, due to the performance of their Query Execution Engines (QEE) for supporting the execution of traditional queries

Parallel Query Execution in PRISMA/DB.

by Annita N. Wilschut, Peter M. G. Apers - in Proceedings of the PRISMA Workshop on Parallel Database Systems , 1990
"... this paper, the possibilities for parallelism in the execution of nested queries on PRISMA/DB are studied. In this study, both the algorithms for individual operations and the order in which operations are executed are taken into account. This paper is organized as follows: The remainder of this int ..."
Abstract - Cited by 8 (5 self) - Add to MetaCart
this paper, the possibilities for parallelism in the execution of nested queries on PRISMA/DB are studied. In this study, both the algorithms for individual operations and the order in which operations are executed are taken into account. This paper is organized as follows: The remainder

Dataflow query execution in a parallel main-memory environment

by Annita N. Wilschut - In Proc. of the International Conference on Parallel and Distributed Information Systems (PDIS , 1991
"... Abstract. In this paper, the performance and characteristics of the execution of various join-trees on a parallel DBMS are studied. The results of this study are a step into the direction of the design of a query optimization strategy that is fit for parallel execution of complex queries. Among othe ..."
Abstract - Cited by 210 (5 self) - Add to MetaCart
Abstract. In this paper, the performance and characteristics of the execution of various join-trees on a parallel DBMS are studied. The results of this study are a step into the direction of the design of a query optimization strategy that is fit for parallel execution of complex queries. Among
Next 10 →
Results 1 - 10 of 4,860
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University