Open AccessProceedings Article
Plan-Per-Tuple Optimization Solution - Parallel Execution of Expensive User-Defined Functions
Felipe Cariño,William O'Connell +1 more
- 24 Aug 1998
- pp 690-695
TL;DR: A new strategy is described for the NCR Teradata Multimedia Database System, referred to as plan-per-tuple, which addresses optimizer challenges particularly related to predicate use of large multimedia objects, such as video/audio clips, images, and text documents.
read more
Abstract: Object-Relational database systems allow users to define new user-defined types and functions. This presents new optimizer and run-time challenges to the database system on shared-nothing architectures. In this paper, we describe a new strategy we are exploring for the NCR Teradata Multimedia Database System; our focus is directing research for real applications we are seeing. In doing so, we will briefly describe optimizer challenges particularly related to predicate use of large multimedia objects, such as video/audio clips, images, and text documents. The motivation for this work is based on database tuning [SD961 for diverse queries related to multimedia objects. Most notably, expensive and/or high variant user defined functions [He198]. Our approach is referred to as plan-per-tuple. The
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Efficiently support MapReduce-like computation models inside parallel DBMS
Qiming Chen,Andy Therber,Meichun Hsu,Hans Zeller,Bin Zhang,Ren Wu +5 more
- 16 Sep 2009
TL;DR: These mechanisms enable us to solve the essential problems in supporting MapReduce and other analytics computation models inside a parallel database engine: modeling complex applications, integrating them into query processing, and shielding analytics developers from DBMS internal details.
25
Data-Continuous SQL Process Model
Qiming Chen,Meichun Hsu +1 more
- 09 Nov 2008
TL;DR: The proposed approach represents a major shift in process management from one-time execution to data stream driven, open-ended execution, and an initial step in bringing BPM technology and database technology together under the data-continuation semantics.
18
Patent
Method, system, and program for selecting a join order for tables subject to a join operation
Thomas A. Beavin,You-Chin Fuh,Joseph F. Sinnott +2 more
- 10 May 2002
TL;DR: In this article, the authors present a method, system, and program for selecting a join order for tables subject to a join operation, where an estimation is made of a join cost to perform joins on permutations of at least two of the tables, wherein each join permutation indicates an order of joining the tables.
17
Scalable information extraction for web queries
Meichun Hsu,Yuhong Xiong +1 more
- 01 Dec 2010
TL;DR: The general problems for building an extensible web query system are described and one of the projects in this area – a vertical search portal for online courses is presented – an attempt to support more precise query on the web for certain content verticals.
3
Making an Array Database Language Server-Side Extensible
Otoniel Jose Campos Escobar,Dimitar Misev,Peter Baumann +2 more
- 10 Dec 2020
TL;DR: The rasdaman Array DBMS as mentioned in this paper is a full-stack C++ implementation, which does not rely on some generic UDF mechanism, but relies on the general C++ client API classes.
1
References
Access path selection in a relational database management system
P. Griffiths Selinger,Morton M. Astrahan,Donald D. Chamberlin,Raymond A. Lorie,T. G. Price +4 more
- 30 May 1979
TL;DR: System R as mentioned in this paper is an experimental database management system developed to carry out research on the relational model of data, which chooses access paths for both simple (single relation) and complex queries (such as joins), given a user specification of desired data as a boolean expression of predicates.
Extensible/rule based query rewrite optimization in Starburst
Hamid Pirahesh,Joseph M. Hellerstein,Waqar Hasan +2 more
- 01 Jun 1992
TL;DR: This paper describes the Query Rewrite facility of the Starburst extensible database system, a novel phase of query optimization, and presents a suite of rewrite rules used in Starburst to transform queries into equivalent queries for faster execution.
Optimization of dynamic query evaluation plans
Richard L. Cole,Goetz Graefe +1 more
- 24 May 1994
TL;DR: The present paper proposes a novel optimization model that assigns the bulk of the optimization effort to compiling-time and delays carefully selected optimization decisions until run-time, and introduces techniques that solve the problem of constructing dynamic plans at compile-time.
A rule-based view of query optimization
Johann-Christoph Freytag
- 01 Dec 1987
TL;DR: This paper describes its operations by transformation rules which generate different QEPs from initial query specifications and hopes that the approach taken will contribute to the more general goal of a modular query optimizer as part of an extensible database management system.
Optimizing queries over multimedia repositories
Surajit Chaudhuri,Luis Gravano +1 more
- 01 Jun 1996
TL;DR: In this article, the authors investigate how to optimize the processing of queries over multimedia repositories and define an execution space that is search-minimal, i.e., the set of indexes searched is minimal.