Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 31 for “"join queries"”.

  1. Answering Join Queries Instantly

    … research presents an innovative way to process queries without having to perform expensive join and set operations. We propose to store the equi-join relationships of tuples on mass storage devices, such as disks, to facilitate query processing. The equi-join relationships are captured, grouped, …

    siu-theses Repository record for Answering Join Queries Instantly (opens in a new tab)

  2. Optimizing select-project-join queries

    … retrieval algorithm for relational database queries is a highly sought after ideal. A great amount of research has been applied in the quest for a better, faster, and cheaper universal retrieval scheme. Unfortunately there is no panacea, no single "optimal" method. With the many different …

    unlv Repository record for Optimizing select-project-join queries (opens in a new tab) Download PDF for Optimizing select-project-join queries (opens in a new tab)

  3. Optimizing the cost of relational join queries

    Thesis (Ph. D.)--Michigan State University. Department of Computer Science, 1988

    msu Repository record for Optimizing the cost of relational join queries (opens in a new tab)

  4. Optimizing Aggregation and Join Queries in Geo-Distributed Data Analytics

    … any GDA system: data aggregation and relational joins. Real-time aggregation and processing of geo-distributed data streams continuously over time often has two competing requirements: first, the results be available at the center within a certain acceptable delay bound and second, the WAN …

    umn Repository record for Optimizing Aggregation and Join Queries in Geo-Distributed Data Analytics (opens in a new tab)

  5. Adapting plan-based re-optimization of multiway join queries for streaming data

    … database community. When the plans for running queries are found to be sub-optimal, re-optimization techniques can be applied to generate new plans on the fly. Because plan-based re-optimization techniques can guarantee effectiveness and improve execution efficiency, they achieve success in …

    nus Repository record for Adapting plan-based re-optimization of multiway join queries for streaming data (opens in a new tab) Download file for Adapting plan-based re-optimization of multiway join queries for streaming data (opens in a new tab)

  6. Processing Exact Results for Queries over Data Streams

    … these applications, it is infeasible to process queries over data streams by loading the data into a traditional database management system (DBMS) or into main memory. Such an approach does not scale with high stream rates. As a consequence, systems that can manage streaming data have gained …

    waterloo Repository record for Processing Exact Results for Queries over Data Streams (opens in a new tab)

  7. Erdvinių duomenų indeksavimas reliacinėse duomenų bazių valdymo sistemose /

    … spatial indexes when executing spatial search queries. The experiment was automated by creating a tool (console application). In the experiment 8 different datasets were used and the SELECT queries were formed by using two out out of multiple functions defined in the second part of the OGC SFA …

    vilnius Repository record for Erdvinių duomenų indeksavimas reliacinėse duomenų bazių valdymo sistemose / (opens in a new tab)

  8. Novel Data Summaries for Join Query Optimization

    … systems has suffered. The execution of join queries, especially multi-join queries, remains one of the field's greatest challenges. We propose novel approaches to such queries using data sketching. Traditional cost-based query optimizers have existed for decades, becoming the de facto …

    washington Repository record for Novel Data Summaries for Join Query Optimization (opens in a new tab)

  9. TECHNIQUES FOR EFFICIENT QUERY REVERSE ENGINEERING

    … query from the large search space of candidate queries. To address this issue, we propose a novel query-centric approach which is able to optimize both candidate query generation as well as query validation. The second challenge is the issue of supporting more expressive target queries. We …

    nus Repository record for TECHNIQUES FOR EFFICIENT QUERY REVERSE ENGINEERING (opens in a new tab) Download file for TECHNIQUES FOR EFFICIENT QUERY REVERSE ENGINEERING (opens in a new tab)

  10. A Cost Model for a Fingered Join Operator in Relational Query Plans

    … the finger aware cursor operator for relational join queries. It scans a list of tuples in a finger enabled manner when a nested loop join operation is performed. Using this scan operation, we improve the performance of nested loop join when compared to when compared to conventional scan. To …

    waterloo Repository record for A Cost Model for a Fingered Join Operator in Relational Query Plans (opens in a new tab)

  11. An R*-Tree Based Semi-Dynamic Clustering Method for the Efficient Processing of Spatial Join in a Shared-Nothing Parallel Database System

    … has made it essential to perform complex spatial queries efficiently. To achieve acceptable performance levels, database systems have been increasingly required to make use of parallelism. The spatial join is a computationally expensive operator. Efficient implementation of the join operator is, …

    uno Repository record for An R*-Tree Based Semi-Dynamic Clustering Method for the Efficient Processing of Spatial Join in a Shared-Nothing Parallel Database System (opens in a new tab)

  12. Robust Recursive Query Parallelization in Graph Database Management Systems

    Recursive joins such as shortest path and variable length path queries are a core feature set of modern graph database management systems (GDBMS). Since these queries tend to be computationally expensive and may suffer from high execution time, they require efficient parallel processing using …

    waterloo Repository record for Robust Recursive Query Parallelization in Graph Database Management Systems (opens in a new tab)

  13. QUERY PROCESSING AND OPTIMIZATION IN MULTIPROCESSOR ENVIRONMENT

    … explores two levels of parallelism on the costly join operation in database query processing: (1) intra-join parallelism, where several processors are assigned to a join operation to parallelize it and (2) inter-join parallelism, where several joins may be concurrently executed. While intra-join …

    nus Repository record for QUERY PROCESSING AND OPTIMIZATION IN MULTIPROCESSOR ENVIRONMENT (opens in a new tab) Download file for QUERY PROCESSING AND OPTIMIZATION IN MULTIPROCESSOR ENVIRONMENT (opens in a new tab)

  14. High Performance Spatial and Spatio-temporal Data Processing

    … from a wide range of domains. Spatial join is at the heart of many of the emerging spatial data analysis applications. However, spatial join processing on even a moderate sized dataset is very time consuming. At the same time, there is a rapid expansion in available processing cores, …

    toronto-retro Repository record for High Performance Spatial and Spatio-temporal Data Processing (opens in a new tab)

  15. Domain Ordering and Box Cover Problems for Beyond Worst-Case Join Processing

    Join queries are a fundamental computational task in relational database management systems. For decades, complex joins were most often computed by decomposing the query into a query plan made of a sequence of binary joins. However, for cyclic queries, this type of query plan is sub-optimal. The …

    waterloo Repository record for Domain Ordering and Box Cover Problems for Beyond Worst-Case Join Processing (opens in a new tab)

  16. Expressive And Scalable Event Stream Processing

    … a large number of reasonably sophisticated queries over high-speed input streams. There are however general tensions between expressiveness and scalability in stream processing. In this dissertation, we present techniques and prototype systems that address both expressiveness and scalability …

    cornell Repository record for Expressive And Scalable Event Stream Processing (opens in a new tab)

  17. Efficient exact similarity joins

    Similarity joins play an important role in many application areas, such as near duplicate Web page detection, data integration and cleaning, record linkage, and pattern recognition. Consequently, there has been much interest in developing efficient algorithms for this fundamental operation. In this …

    unsw Repository record for Efficient exact similarity joins (opens in a new tab)

  18. Δόμηση σημειακών δεδομένων και επεξεργασία χωρικών ερωτημάτων

    … and popular R-trees in both types of spatial queries with one or two input data sets. We proposed two enhancements on algorithms using classic plain sweep for join queries (kCPQ, εDJQ) with two input spatial data sets stored in main memory. One new algorithm (Reverse Run Plain Sweep - RRPS) …

    greece Repository record for Δόμηση σημειακών δεδομένων και επεξεργασία χωρικών ερωτημάτων (opens in a new tab)

  19. Top-k similarity join over multi-valued objects

    The join query is a fundamental tool in many modern application areas including location-based services, geographic information system (GIS), finance and capital markets analysis, etc. Given two sets of objects U and V, a top-k similarity join returns k pairs of most similar objects from U x V. The …

    unsw Repository record for Top-k similarity join over multi-valued objects (opens in a new tab)

  20. Privacy-preserving queries on encrypted databases

    … due to the high complexity of many important queries on encrypted large-scale datasets. This thesis studies the problem of privacy-preserving database query processing on structured data (e.g., relational and graph databases). In particular, this thesis proposes several practical and provable …

    bu Repository record for Privacy-preserving queries on encrypted databases (opens in a new tab)

Page 1 of 2