Log in

Relevant bibliographies by topics / Query optimization / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Query optimization.

Dissertations / Theses on the topic 'Query optimization'

Author: Grafiati

Published: 4 June 2021

Last updated: 26 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Query optimization.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Yu, Feng. "Constructing Accurate Synopses for Database Query Optimization and Re-optimization." OpenSIUC, 2013. https://opensiuc.lib.siu.edu/dissertations/709.

Full text

Abstract:

Fast and accurate estimations for complex queries are profoundly beneficial for large databases with heavy workloads. The most widely adopted query optimizers use synopses to tune up the databases in manners of optimization and re-optimization. From Chapter 1 to Chapter 3, we focus on the synopses for query optimization. We propose a statistical summary for a database, called CS2 (Correlated Sample Synopsis), to provide rapid and accurate result size estimations for all queries with joins and arbitrary selections. Unlike the state-of-the-art techniques, CS2 does not completely rely on simple

APA, Harvard, Vancouver, ISO, and other styles

2

Brasetvik, Alex, and Hans Olav Norheim. "iAD: Query Optimization in MARS." Thesis, Norwegian University of Science and Technology, Department of Computer and Information Science, 2009. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-9099.

Full text

Abstract:

<p>This document is the report for the authors' joint effort in researching and designing a query optimizer for Fast's next-generation search platform, known as MARS. The work was done during our master's thesis at the Department of Computer and Information Science at the Norwegian University of Science and Technology, spring 2009. MARS does not currently employ any form of query optimizer, but does have a parser and a runtime system. The report therefore focuses on the core query optimizing aspects, like plan generation and optimizer design. First, we give an introduction to query optimizers

APA, Harvard, Vancouver, ISO, and other styles

3

Genet, Bryan Howard. "Is Semantic Query Optimization Worthwhile?" The University of Waikato, 2007. http://hdl.handle.net/10289/2531.

Full text

Abstract:

The term quote semantic query optimization quote (SQO) denotes a methodology whereby queries against databases are optimized using semantic information about the database objects being queried. The result of semantically optimizing a query is another query which is syntactically different to the original, but semantically equivalent and which may be answered more efficiently than the original. SQO is distinctly different from the work performed by the conventional SQL optimizer. The SQL optimizer generates a set of logically equivalent alternative execution paths based ultimately on the rules

APA, Harvard, Vancouver, ISO, and other styles

4

Waas, Florian Michael. "Principles of probabilistic query optimization." [S.l. : Amsterdam : s.n.] ; Universiteit van Amsterdam [Host], 2000. http://dare.uva.nl/document/83735.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Waite, Edwin Richard. "Web Based Query Optimization Simulator." CSUSB ScholarWorks, 2004. https://scholarworks.lib.csusb.edu/etd-project/2519.

Full text

Abstract:

The Web Based Query Optimization Simulator (WBQOS) is a software tool designed to enhance understanding of query optimization with a Relational Database Management System (RDBMS). WBQOS allows the user to visualize and participate in query optimization, which enhances the learning process.

APA, Harvard, Vancouver, ISO, and other styles

6

Shastri, Avani. "MTopS: Multi-Query Optimization for Continuous Top-K Query Workloads." Digital WPI, 2011. https://digitalcommons.wpi.edu/etd-theses/759.

Full text

Abstract:

A continuous top-k query retrieves the k most preferred objects from a data stream according to a given preference function. These queries are important for a broad spectrum of applications from web-based advertising, network traffic monitoring, to financial analysis. Given the nature of such applications, a data stream may be subjected at any given time to multiple top-k queries with varying parameter settings requested simultaneously by different users. This workload of simultaneous top-k queries must be executed efficiently to assure real time responsiveness. However, existing methods in t

APA, Harvard, Vancouver, ISO, and other styles

7

Elsidani, Elariss Haifa. "A new visual query language and query optimization for mobile GPS." Thesis, Kingston University, 2008. http://eprints.kingston.ac.uk/20306/.

Full text

Abstract:

In recent years computer applications have been deployed to manage spatial data with Geographic Information Systems (GIS) to store and analyze data related to domains such as transportation and tourism. Recent developments have shown that there is an urgent need to develop systmes for mobile devices and particularly for Location Based Services (LBS) such as proximity analysis that helps in finding the nearest neighbors, for example. restaurant, and the facilities that are located within a circle area around the user's location, known as a buffer area, for example, all restaurants within 100 me

APA, Harvard, Vancouver, ISO, and other styles

8

Wang, Di. "Query optimization for database federation systems." Worcester, Mass. : Worcester Polytechnic Institute, 2009. http://www.wpi.edu/Pubs/ETD/Available/etd-050409-131957/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Blunschi, Lukas. "Cost-based query optimization in iMeMex." Zurich : ETH, Swiss Federal Institute of Technology, Department of Computer Science, Databases and Information Systems Group, 2007. http://e-collection.ethbib.ethz.ch/show?type=dipl&nr=425.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Eom, Boyun. "Query optimization using frequent itemset mining." [Gainesville, Fla.] : University of Florida, 2005. http://purl.fcla.edu/fcla/etd/UFE0010844.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Paulley, Glenn N. "Exploiting functional dependence in query optimization." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0028/NQ51220.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Liu, Ying. "Query optimization for distributed stream processing." [Bloomington, Ind.] : Indiana University, 2007. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:3274258.

Full text

Abstract:

Thesis (Ph.D.)--Indiana University, Dept. of Computer Science, 2007.<br>Source: Dissertation Abstracts International, Volume: 68-07, Section: B, page: 4597. Adviser: Beth Plale. Title from dissertation home page (viewed Apr. 21, 2008).

APA, Harvard, Vancouver, ISO, and other styles

13

Simonenko, Ekaterina. "OLAP query optimization and result visualization." Thesis, Paris 11, 2011. http://www.theses.fr/2011PA112138.

Full text

Abstract:

Nous explorons différents aspects des entrepôts de données et d’OLAP, le point commun de nos recherches étant le modèle fonctionnel pour l'analyse de données. Notre objectif principal est d'utiliser ce modèle dans l'étude de trois aspects différents, mais liés:- l'optimisation de requêtes par réécriture et la gestion du cache,- la visualisation du résultat d'une requête OLAP,- le mapping d'un schéma relationnel en BCNF vers un schéma fonctionnel. L'optimisation de requêtes et la gestion de cache sont des problèmes cruciaux dans l'évaluation de requêtes en général, et les entrepôts de données e

APA, Harvard, Vancouver, ISO, and other styles

14

Scheufele, Wolfgang. "Algebraic query optimization in Database Systems /." [S.l. : s.n.], 1999. http://www.bsz-bw.de/cgi-bin/xvms.cgi?SWB8299303.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Yu, Qi. "A Foundational Framework for Service Query Optimization." Diss., Virginia Tech, 2008. http://hdl.handle.net/10919/28530.

Full text

Abstract:

In this dissertation, we present a novel foundational framework that lays out a theoretical underpinning for the emerging services science. The proposed framework provides disciplined and systematic support for efficient access to Web services' functionalities. The key components of the proposed framework centers around a novel service model that provides a formal abstraction of the Web services within an application domain. A service calculus and a service algebra are defined to facilitate users in accessing services via declarative service queries. We provide the implementation of the servi

APA, Harvard, Vancouver, ISO, and other styles

16

BRANT, MICHAEL J. "BINDING HASH TECHNIQUE FOR XML QUERY OPTIMIZATION." University of Cincinnati / OhioLINK, 2006. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1148148857.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

MALLADI, RAJESWARI. "APPLYING MULTIPLE QUERY OPTIMIZATION IN MOBILE DATABASES." University of Cincinnati / OhioLINK, 2001. http://rave.ohiolink.edu/etdc/view?acc_num=ucin996673274.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Sridharan, Srilakshmi. "Data Mining-based Fragmentation for Query Optimization." University of Cincinnati / OhioLINK, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1397467744.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Karnagel, Tomas. "Heterogeneity-Aware Placement Strategies for Query Optimization." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2017. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-225613.

Full text

Abstract:

Computing hardware is changing from systems with homogeneous CPUs to systems with heterogeneous computing units like GPUs, Many Integrated Cores, or FPGAs. This trend is caused by scaling problems of homogeneous systems, where heat dissipation and energy consumption is limiting further growths in compute-performance. Heterogeneous systems provide differently optimized computing hardware, which allows different operations to be computed on the most appropriate computing unit, resulting in faster execution and less energy consumption. For database systems, this is a new opportunity to accelerat

APA, Harvard, Vancouver, ISO, and other styles

20

Bai, Yijian. "Data stream processing and query optimization techniques." Diss., Restricted to subscribing institutions, 2007. http://proquest.umi.com/pqdweb?did=1472132461&sid=1&Fmt=2&clientId=1564&RQT=309&VName=PQD.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Pansare, Niketan R. "Multi-query optimization in the Datapath system." [Gainesville, Fla.] : University of Florida, 2009. http://purl.fcla.edu/fcla/etd/UFE0025140.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Benouaret, Karim. "Advanced techniques for Web service query optimization." Thesis, Lyon 1, 2012. http://www.theses.fr/2012LYO10177/document.

Full text

Abstract:

De nos jours, nous assistons à l’émigration du Web de données vers le Web orienté services. L’amélioration des capacités et fonctionnalités des moteurs actuels de recherche sur le Web, par des techniques efficaces de recherche et de sélection de services, devient de plus en plus importante. Dans cette thèse, dans un premier temps, nous proposons un cadre de composition de services Web en tenant compte des préférences utilisateurs. Le modèle fondé sur la théorie des ensembles flous est utilisé pour représenter les préférences. L’approche proposée est basée sur une version étendue du principe d’

APA, Harvard, Vancouver, ISO, and other styles

23

Wang, Song. "State-Slice: A New Stream Query Optimization Paradigm for Multi-query and Distributed Processing." Worcester, Mass. : Worcester Polytechnic Institute, 2008. http://www.wpi.edu/Pubs/ETD/Available/etd-032508-044505/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Liu, Feilong. "Accelerating Analytical Query Processing with Data Placement Conscious Optimization and RDMA-aware Query Execution." The Ohio State University, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=osu1543532295915722.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Fu, Qiuling. "Distributed query optimization using multi-attribute semijoin operations." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1996. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp04/MQ30903.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Li, Jinmiao. "An object-oriented framework for extensible query optimization." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp05/MQ64085.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Sayli, Ayla. "Semantic query optimization in relational database management systems." Thesis, University of Essex, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.284608.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Richardson, Bartley D. "A Performance Study of XML Query Optimization Techniques." University of Cincinnati / OhioLINK, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1258475256.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Fomkin, Ruslan. "Optimization and Execution of Complex Scientific Queries." Doctoral thesis, Uppsala : Acta Universitatis Upsaliensis, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-9514.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Kamat, Sandeep. "Dynamic strategy and Bloom filters in distributed query optimization." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1996. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp04/MQ30910.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Osborn, Wendy K. "The use of reduction filters in distributed query optimization." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape10/PQDD_0020/MQ52626.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Yu, Chaoping. "Query optimization for Federated Database Systems: the Cyrano prototype." Thesis, Virginia Tech, 1996. http://hdl.handle.net/10919/44452.

Full text

Abstract:

The purpose of this research is to improve the performance for the query processing of Cyrano, a prototype deductive object-oriented meta model for Federated Database Systems (FDBSs). The hypothesis was that query optimization techniques such as Semi-Naive algorithm and Magic-Sets Rewrite algorithm could be used to improve the performance of Cyrano prototype query processing. Query optimization has not been used for an FDBS with a deductive object-oriented meta model. Most existing FDBS query optimization techniques are for FDBSs with relational meta models. This research involves two major s

APA, Harvard, Vancouver, ISO, and other styles

33

Yu, Zhao-Ping. "Query optimization for Federated Database Systems : the Cyrano prototype /." This resource online, 1996. http://scholar.lib.vt.edu/theses/available/etd-08252008-162919/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Trissl, Silke. "Cost-based optimization of graph queries in relational database management systems." Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2012. http://dx.doi.org/10.18452/16544.

Full text

Abstract:

Graphen sind in vielen Bereichen des Lebens zu finden, wobei wir speziell an Graphen in der Biologie interessiert sind. Knoten in solchen Graphen sind chemische Komponenten, Enzyme, Reaktionen oder Interaktionen, die durch Kanten miteinander verbunden sind. Eine effiziente Ausführung von Graphanfragen ist eine Herausforderung. In dieser Arbeit präsentieren wir GRIcano, ein System, das die effiziente Ausführung von Graphanfragen erlaubt. Wir nehmen an, dass Graphen in relationalen Datenbankmanagementsystemen (RDBMS) gespeichert sind. Als Graphanfragesprache schlagen wir eine erweiterte Versi

APA, Harvard, Vancouver, ISO, and other styles

35

Liang, Yan. "Reduction of collisions in Bloom filters during distributed query optimization." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape7/PQDD_0013/MQ52744.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Uno, Yushi. "Studies on the Optimization of Query Processing in Deductive Databases." Kyoto University, 1995. http://hdl.handle.net/2433/160760.

Full text

Abstract:

本文データは平成22年度国立国会図書館の学位論文(博士)のデジタル化実施により作成された画像ファイルを基にpdf変換したものである<br>Kyoto University (京都大学)<br>0048<br>新制・課程博士<br>博士(工学)<br>甲第6018号<br>工博第1415号<br>新制||工||984(附属図書館)<br>UT51-95-D337<br>京都大学大学院工学研究科応用システム科学専攻<br>(主査)教授長谷川利治, 教授茨木俊秀, 教授上林彌彦<br>学位規則第4条第1項該当

APA, Harvard, Vancouver, ISO, and other styles

37

Zhou, Zehai 1962. "Data allocation and query optimization in large scale distributed databases." Diss., The University of Arizona, 1996. http://hdl.handle.net/10150/282189.

Full text

Abstract:

Distributed database technology is expected to have a significant impact on data processing in the upcoming years because distributed database systems have many potential advantages over centralized systems for geographically distributed organizations. Data allocation and query optimization are two of the most important aspects of distributed database design. Data allocation involves placing a database and the applications that run against it in the multiple sites of a network. It is a very complex problem consisting of two processes: data fragmentation and fragment allocation. Data fragmentat

APA, Harvard, Vancouver, ISO, and other styles

38

Wei, Mingrui. "Multi-Mode Stream Processing For Hopping Window Queries." Digital WPI, 2008. https://digitalcommons.wpi.edu/etd-theses/769.

Full text

Abstract:

Window constraints are mechanisms to bound the tuples processed by continuous queries specified over unbounded data streams. While sliding window queries move the constraint window upon the arrival of each individual tuple, hopping window queries instead move the window by a fixed amount after some period, thus periodically refreshing their results. We observe that for large hops, techniques liked delta result updating may not be efficient -- as large portions of the tuples in the current window will be different from the previous window and thus must be maintained. On the other hand,

APA, Harvard, Vancouver, ISO, and other styles

39

Zhu, Yali. "Dynamic optimization and migration of continuous queries over data streams." Link to electronic dissertation, 2006. http://www.wpi.edu/Pubs/ETD/Available/etd-082306-133807/.

Full text

Abstract:

Dissertation (Ph.D.)--Worcester Polytechnic Institute.<br>Keywords: Query optimization, data streams, runtime query adaptations, continuous queries, plan migration, distributed query processing, window constraints. Includes bibliographical references (p. 313 - 319 ).

APA, Harvard, Vancouver, ISO, and other styles

40

Zhang, Chao. "Optimization of User-Defined Aggregate Functions : Parallization and Sharing." Thesis, Université Clermont Auvergne‎ (2017-2020), 2019. http://www.theses.fr/2019CLFAC100.

Full text

Abstract:

Les applications des agrégations pour la synthèse d’informations sont significatives dans de nombreux domaines. Les agrégations incorporées par défaut dans les systèmes ne sont pas suffisantes pour satisfaire les besoins qui émergent avec les progrès de l’analyse de données. Les UDAFs (User-Defined Aggregate Functions ou, en français, fonctions d’agrégation définies par l’utilisateur) sont en train de devenir un des opérateurs fondamentaux en analyse de données avancée. Le mécanisme UDAF fourni par la plupart des systèmes modernes souffre cependant d’au moins deux défauts : la définition d’UDA

APA, Harvard, Vancouver, ISO, and other styles

41

Jian, Jinhuj. "Efficient XML stream processing with automata and query algebra." Link to electronic thesis, 2003. http://www.wpi.edu/Pubs/ETD/Available/etd-0827103-152442.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Sevinc, Ender. "Genetic Algorithms For Distributed Database Design And Distributed Database Query Optimization." Phd thesis, METU, 2009. http://etd.lib.metu.edu.tr/upload/3/12611194/index.pdf.

Full text

Abstract:

The increasing performance of computers, reduced prices and ability to connect systems with low cost gigabit ethernet LAN and ATM WAN networks make distributed database systems an attractive research area. However, the complexity of distributed database query optimization is still a limiting factor. Optimal techniques, such as dynamic programming, used in centralized database query optimization are not feasible because of the increased problem size. The recently developed genetic algorithm (GA) based optimization techniques presents a promising alternative. We compared the best known GA with

APA, Harvard, Vancouver, ISO, and other styles

43

Ivert, Annica. "LINEAR PROGRAMMING OPTIMIZATION OF QUERY ALLOCATION IN A DISTRIBUTED CEP SYSTEM." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-102390.

Full text

Abstract:

In Fujitsu’s up-and-coming Complex Event Processing service, the servers used for query-storage lie in a cloud environment. The cost of setting up the user-defined systems can therefore immediately be translated into the number of servers that is required and the amount of data that need to be sent between the servers. The objective of this thesis was to provide a model that optimizes the cost of setting up these systems. The problem of query allocation has been modeled a linear program, such that the number of servers needed and the communication between them is minimized. This turns out to b

APA, Harvard, Vancouver, ISO, and other styles

44

Li, Ming. "Semantic query optimization for processing XML streams with minimized memory footprint." Link to electronic thesis, 2007. http://www.wpi.edu/Pubs/ETD/Available/etd-082507-044510/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Pittges, Jeff. "Metadata view graphs : a framework for query optimization and metadata management." Diss., Georgia Institute of Technology, 1995. http://hdl.handle.net/1853/9256.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Kerdprasop, Nittaya. "The Application of Inductive Logic Programming to Support Semantic Query Optimization." NSUWorks, 1999. http://nsuworks.nova.edu/gscis_etd/632.

Full text

Abstract:

Inductive logic programming (ILP) is a recently emerging subfield of machine learning that aims at overcoming the limitations of most attribute-value learning algorithms by adopting a more powerful language of first-order logic. Employing successful learning techniques of ILP to learn interesting characteristics among database relations is of particular interest to the knowledge discovery in databases research community. However, most existing ILP systems are general-purpose learners and that means users have to know how to tune some factors of ILP learners to best suit their tasks at hand. On

APA, Harvard, Vancouver, ISO, and other styles

47

Liu, Mo. "Extending Event Sequence Processing:New Models and Optimization Techniques." Digital WPI, 2012. https://digitalcommons.wpi.edu/etd-dissertations/167.

Full text

Abstract:

Many modern applications, including online financial feeds, tag-based mass transit systems and RFID-based supply chain management systems transmit real-time data streams. There is a need for event stream processing technology to analyze this vast amount of sequential data to enable online operational decision making. This dissertation focuses on innovating several techniques at the core of a scalable E-Analytic system to achieve efficient, scalable and robust methods for in-memory multi-dimensional nested pattern analysis over high-speed event streams. First, I address the problem of processin

APA, Harvard, Vancouver, ISO, and other styles

48

陳統一. "Query-oriented & Data-oriented Semantic Query Optimization." Thesis, 1997. http://ndltd.ncl.edu.tw/handle/99804394338791140583.

Full text

Abstract:

碩士<br>國立成功大學<br>工程科學研究所<br>85<br>"Information in hand; opportunity in hand" is no longer just a motto keeping in mind. Universal developments of information have being rising a new tide in the end of the 20th century. Having the advantage of technology, persons could get information through the database. The more people depend on the database, and the kind or the amount of data is getting complex; the more essential the efficiency for query is. To avoid suffering from the trouble of query, we have to build up the intelligent strategy. Whwat we have to do with is to transform the user's or

APA, Harvard, Vancouver, ISO, and other styles

49

El-Helw, Amr. "Query Optimization in Dynamic Environments." Thesis, 2012. http://hdl.handle.net/10012/6710.

Full text

Abstract:

Most modern applications deal with very large amounts of data. Having to deal with such huge amounts of data is in itself a challenge. This challenge is complicated even more by the fact that, in many cases, this data is constantly changing and evolving. For instance, relational databases that handle the data of day-to-day transactional applications often have tables with very high data change rates. It is not uncommon to even have temporary or volatile tables that get created from scratch and completely dropped over the course of one query workload. This dissertation focuses on optimizing st

APA, Harvard, Vancouver, ISO, and other styles

50

McMahan, Benjamin James. "Structural heuristics for query optimization." Thesis, 2004. http://hdl.handle.net/1911/17707.

Full text

Abstract:

The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach to join-query optimization is cost based, which requires developing a cost model, assigning an estimated cost to each query-processing plan, and searching in the space of all plans for a plan of minimal cost. But as the number of joins increases, the size of the search space grows exponentially. Another approach to the problem, one that has been successful in constraint satisfaction, is that of structural optimization

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!