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 853 for “"queries"”.
-
Visualizing database queries
… on visualizations to interpret the results of queries. However, finding the right visualization for a query is a laborious and time-consuming task. We propose SEEDB, a system that partially automates this task: given a query, SEEDB explores the space of all possible visualizations, and …
-
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, …
-
Optimizing Queries with Disjunctions
… of research into query optimization, optimizing queries with disjunctive predicate expressions remains a challenge. Solutions employed by existing systems (if any) are often simplistic and lead to much redundant work being performed by the execution engine. In this thesis, we present a …
-
Evaluating Temporal Queries over Videos
… three research problems on evaluating temporal queries with such annotations. Specifically, we first investigate the temporal queries that consider only co-occurrence relationships between objects on video feeds, where we take the first step and define such queries in a way that they incorporate …
-
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 …
-
Learning to reformulate long queries
Long search queries are useful because they let the users specify their search criteria in more detail. However, the user often receives poor results in response to the long queries from today's Information Retrieval systems. For the document to be returned as a relevant result, the system requires …
-
Efficient computation of advanced skyline queries.
… mining and visualization, and user-preference queries. Due to its importance, skyline and its computation have received considerable attention from database research community recently. All the existing techniques, however, focus on the conventional databases. They are not applicable to online …
-
Improving Performance of Spatial Network Queries
Spatial network queries, for example KNN or range, operate on systems where objects are constrained to locations on a network. Current spatial network query algorithms rely on forms of network traversal which have a high complexity proportional to the size of the network making, them poor for large …
-
Learning hypertrees with shortest path queries
… for learning discrete structured objects from queries. In this context, we consider the problem of learning a labeled hypergraph from a given family of hypergraphs using shortest path (SP) queries. An SP query specifies two vertices and asks for their distance in the target hypergraph. For …
-
LSPARQL: Transaction Time Queries in RDF
… that partially sidesteps this issue by executing queries over a standard transaction log which are commonly supported by most triplestores. We provide a formal definition of the semantics of a log-based data model and of our query language. We describe a proof-of-concept implementation that …
-
Improving Web Search for Difficult Queries
… very successfully, there are still a lot of queries that search engines can not answer very effectively and these queries always make users feel frustrated. Since it is quite often that users encounter such ``difficult queries,'' improving Web search for these queries can bring significant …
-
Efficient processing of similarity queries with applications
… process Hamming-distance-based similarity queries (Hamming-distance select and Hamming-distance join) that are crucial to many applications. We introduce a new index, termed the HA-Index, that speeds up distance comparisons and eliminates redundancies when performing the two flavors of …
-
Validation of queries to a relational database
This thesis addresses the problem of preventing users of a data base system from interrogating it with query language expressions which are syntactically and semantically valid but which do not match the user's intentions. A method of assisting users of a relational data base to formulate query …
-
Low latency queries on big graph data
The availability of large datasets and on-demand system capacity to analyze these datasets has led to exciting new applications in the context of big graph data. Many big graph data applications --- social search and ranking, personalized and socially-sensitive search, social network analysis, …
-
Accelerating queries for structured and unstructured data
Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2026-05-01
-
Splinter : practical private queries on public data
… that offers absolute privacy when making routing queries, through the application of the Function Secret Sharing (FSS) cryptographic primitive. I worked on a library in Golang that applied an optimized FSS protocol, and exposed an API to generate and evaluate different kinds of queries. I then …
-
Instance-Optimized Data Structures for Membership Queries
We are near the end of Moore’s law and hardware growth has hit a stagnation. Modern data processing systems need to continuously improve their performance to match the humongous growth of data. Data structures and algorithms such as sorting, indexes, filters, hash tables, query optimization, etc …
-
Making fast informative queries with learned propagations
… a certain objective by issuing a series of queries to an oracle and receives a series of observations in return. It is a challenging task because the queries need to account for the uncertainties of the oracle, while being informative to the objective at hand. While successful algorithms …
Page 1 of 43