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 24 for “"Join Algorithms"”.
-
Search and Join Algorithms for Tables in Data Lakes
… data lakes: searching for tables that can be joined, and auto-generating syntactic transformations for joining tables with join values of different formats. Given a query table and a join column, the first problem is defined as searching for tables that can be joined with the query table on …
-
Relational Joins on GPUs for In-Memory Database Query Processing
Relational join processing is one of the core functionalities in database management systems. Implementing join algorithms on parallel platforms, especially modern GPUs, has gain a lot of momentum in the past decade. This dissertation addresses the following issues on GPU join algorithms. First, we …
-
Multi-way hash join effectiveness
In database systems most join algorithms are binary and will only operate on two inputs at a time. In order to join more than two input relations a database system will use the results of a binary join of two of the inputs in a second join. This way any number of input relations can be combined …
-
An agent-based adaptive join algorithm for building data warehouses
… requires complex queries involving a series of joins and aggregations. Many commercial data warehouse systems place limits on such operations at runtime or sacrifice precision by using approximate replication. The join operation is one of the most expensive operations in query processing as it …
-
Efficient processing of XML twig pattern matching
… in this thesis a series of new holistic twig join algorithms by which query trees are matched as a whole so that the size of irrelevant intermediate results can be greatly reduced. Through an extensive performance study, the proposed solutions are shown to be effective, efficient and scalable, …
-
New Algorithmic Tools for Distributed Similarity Search and Edge Estimation
… problems center around the theme of improving algorithms by utilizing geometric or graphical structure. Some contributions include: - Improved upper and lower bounds for computing a similarity join under Hamming distance in a simultaneous distributed model. The core of our analysis involves …
-
Improving hash join performance by exploiting intrinsic data skew
… used to find related information is a hash join algorithm. Although mitigating the negative effects of skew on hash joins has been studied, no prior work has examined how the statistics present in modern database systems can allow skew to be exploited and used as an advantage to improve the …
-
Performance Evaluation and Extension of Cachejoin in a Real-Life Environment
… this semi-stream processing is a process of joining an incoming stream data (transactional data) with the disk-based slow retrieving master data by using an effective join operator. Typically this join operator works with a limited amount of main memory which cannot hold the entire disk-based …
-
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 …
-
Dynamic Energy-Aware Database Storage and Operations
… best existing algorithm in literature. Stream join is a dynamic and expensive database operation that performs join operation in real-time fashion on continuous data streams. Stream joins, also known as window joins, impose high computational time and potentially higher energy consumption …
-
Algebraic methods for incremental maintenance and updates of views within XML databases
… structural identifiers for XML and structural join algorithms. Methods for incrementally handling the view maintenance and view update problem are presented and the benefits of these methods over existing algorithms are established by means of experiments. These experiments also depict the …
-
Heterogeninių dokumentų duomenų apjungimas /
… which showed that there are various ways of joiningheterogeneous document data: from common object request broker architecture to special searchtools likeIBM DB connectandSphereSearch. During analysis, it was made clear that the bestway of combining heterogeneous data is using parallel hash …
-
Analytical Modeling of High Performance Reconfigurable Computers: Prediction and Analysis of System Performance.
… modeling methodology for a class of fork-join algorithms executing on a High Performance Reconfigurable Computing (HPRC) platform. The model includes the effects of the reconfigurable device, application load imbalance, background user load, basic message passing communication, and …
-
Advanced Methods for Large and Long String/Set Similarity Searches
… datasets. Thus, designing efficient SSS algorithms and integrating new technologies to optimize SSS have become key research issues. This study explores SSS techniques, focusing on string/set similarity query and join algorithms under various similarity functions, as well as learned index …
-
Κλιμακώσιμοι και βασισμένοι στο φόρτο εργασίας αλγόριθμοι διαχείρισης μη δομημένων δεδομένων
… In this thesis, we devise distributed algorithms and techniques for data management, which can scale and handle huge datasets. We introduce H2RDF+, a fully distributed RDF store that combines the MapReduce processing framework with a NoSQL distributed database. Creating 6 indexes over …
-
Query processing in temporal object-oriented databases
… further decomposed and evaluated using different algorithms. The intermediate results of traversing the two sub-paths are then joined together to create the query output. Algorithms for processing the decomposed query components, i. e., time-related operation algorithms, four join algorithms …
-
Theoretical Bounds and Systems Development for Exact/Approximate Multiplicities in Bag PDBs
… the corresponding deterministic query evaluation algorithms (under certain complexity hardness conjectures). Using a reduction from the problem of counting k-matchings, this work demonstrates that calculating the expectation is #W[1]-hard when the polynomial is compressed, for example through …
-
Techniques and systems for online and distributed database processing
… variable delays. New query processing algorithms, and in particular join algorithms, need to be designed in order to retrieve valuable information from this type of input as soon as incoming data is available. This thesis addresses two common operations: the join of two (or more) data …
-
On Efficient processing of XML data and their applications
… processor, we proposes an efficient structural join algorithm that can be implemented on top of existing relational databases. Experiments show the proposed method outperforms previous work in both queries and updates. For complicated XML query patterns, a new twig join algorithm called …
-
A scalable analysis framework for large-scale RDF data
… scalability. (2) Several novel parallel join algorithms, to efficiently handle skew over large data during query processing. The approaches have achieved good load balancing and have been demonstrated to be faster than the state-of-art techniques in both theoretical and experimental …
Page 1 of 2