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 109 for “"query processing"”.
-
Skyline Query Processing
This thesis deals with a special subset of multi-dimensional set of points, called the Skyline. These points are the maxima or minima of the complete set and are of special interest for the field of decision support. Coming from basic algorithms for computing the Skyline we will develop ideas and …
-
ICEDB : intermittently-connected continuous query processing
… existing distributed data management and stream processing are not appropriate for such applications because they assume that the network connecting nodes in the data processor is "always on," and that the absence of a network connection is a fault that needs to be masked to avoid failure. This …
-
Federated Query Processing for the Semantic Web
… specify directly what RDF data set they want to query, or making this process transparent to them). To overcome this heterogeneity in federated query processing solutions, the W3C SPARQL working group is defining a federation extension for SPARQL 1.1, which allows combining in a single query, …
-
Query processing using views in semistructured databases
… deal with the data source particular schema and query languages. XML is also rapidly becoming popular for representing web data as it brings a finely granulated structure to the web information and exposes the semantics of the web content. In all these web applications including electronic …
-
Grouping of semistructured data for efficient query processing
… for the optimisation of semistructured data processing based on data groupings. Such groupings are of fundamental importance for efficient querying of semistructured data.The semistructured model does not imply the natural organisation of data that characterises rigidly structured …
-
Robust data partitioning for ad-hoc query processing
Data partitioning can significantly improve query performance in distributed database systems. Most proposed data partitioning techniques choose the partitioning based on a particular expected query workload or use a simple upfront scheme, such as uniform range partitioning or hash partitioning on …
-
Query processing in heterogeneous distributed database management systems
The goal of this work is to present an advanced query processing algorithm formulated and developed in support of heterogeneous distributed database management systems. Heterogeneous distributed database management systems view the integrated data through an uniform global schema. The query …
-
Volatility-Aware Query Processing in Peer-to-Peer Systems
… that can aggregate enormous storage and processing resources for information sharing and distributed computing. This paradigm has received significant attention in both academic and industry. However, most of the effort has been focused on developing efficient searching mechanisms to …
-
Analytical Query Processing Based on Continuous Compression of Intermediates
… these data, the importance of Online Analytical Processing (OLAP) workloads is constantly growing. At the same time, the hardware landscape is continuously evolving. On the one hand, the increasing capacities of DRAM allow database systems to store their entire data in main memory. Furthermore, …
-
KNN Query Processing in Wireless Sensor and Robot Networks
… to one of the robots. In the k nearest neighbour query processing problem in WSRNs, the robot receives event report needs to find exact k nearest robots (KNN) to react to the event, among those connected to it. We are interested in localized solutions, which avoid message flooding to the whole …
-
Privacy-preserving query processing over encrypted data in cloud
<p>"The query processing of relational data has been studied extensively throughout the past decade. A number of theoretical and practical solutions to query processing have been proposed under various scenarios. With the recent popularity of cloud computing, data owners now have the opportunity to …
-
Holistic Boolean Twig Pattern Matching for Efficient XML Query Processing
… algorithms have been proposed for efficiently processing the twig patterns in XML queries. However, a more general form of twig pattern, called Boolean-twig (or B-twig for short), which allows arbitrary combination of an arbitrary number of all the three logical connectives, AND, OR, and NOT, …
-
Ontology-Based Free-Form Query Processing for the Semantic Web
… of ontologies or familiarity with a new query language would likely frustrate semantic web users and prevent widespread success. Given this need, this thesis describes AskOntos, which is a system that uses extraction ontologies to convert conjunctive, free-form queries into structured …
-
Parallel load and query processing in a distributed array database
… as a long term solution for managing and querying this type of data. This thesis presents Multinode-TileDB, a distributed framework that extends TileDB, a new array database management system designed, from the ground up, to handle skewed and sparse arrays. We design the overall …
-
PPDQ-BG: Parallel Partition and Distributed Query Processing for Big Graphs
… computations to perform big graph analysis and query processing. Graph data represent irregular and unstructured relationships that usually result in a lack of locality so that it is often difficult to extract relevant information from big graphs. Although there have been advances in graph …
-
Distributed RDF query processing and reasoning for big data / linked data
… such statements shapes an RDF graph. SPARQL is a query language designed specifically to query RDF data. Linked Data faces the same challenge that Big Data does. We now lead the way to a new wave of a new paradigm, Big Data and Linked Data that identify massive amounts of data in a connected form. …
-
Assembling regions for efficacious aggregate query processing in wireless sensor networks
… values that are measured is not required by the query which is submitted to the network. The query asks for an aggregate over the measurements. The propagation of all measured values to a central computation point is resource consuming. Tiny AGgregation (TAG) provides an algorithm to compute …
-
Neural architectures for database query processing, syntax analysis, knowledge representation, and inference
… for content-based associative symbolic processing. This offers an opportunity to explore the potential benefits of ANN's inherent parallelism in the design of high performance computing systems for real time content-based symbolic processing applications. We develop methods to …
Page 1 of 6