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 13 of 13 for “"Query planning"”.
-
Enhance Database Query Performance through Software Optimization and Hardware Adaptation
… of GPUs has become essential to ensure good query performance. However, without careful query planning and hardware-aware execution, database queries can underutilize GPU resources. To fully unlock GPU potential, my thesis focuses on improving query performance through a combination of …
-
Adaptive probabilistic roadmap construction with multi-heuristic local planning
The motion planning problem means the computation of a collision-free motion for a movable object among obstacles from the given initial placement to the given end placement. Efficient motion planning methods have many applications in many fields, such as robotics, computer aided design, and …
-
Query Evaluation in the Presence of Fine-grained Access Control
… storage of massive access controls, efficient query planning for secure query evaluation, and accurate cardinality estimation for access controlled data. Because fine-grained access controls specify access rights from each user to each piece of data in the system, they are effectively a massive …
-
ENABLING MULTI-PARTY COLLABORATIVE DATA ACCESS
… were examined: Combine rule enforcement and query planning and devise an algorithm which simultaneously checks for the enforceability of each rule and generation of minimum cost plan of its execution using a cost metric whenever the enforcement is possible; We also consider other forms of …
-
Oatlog: A high-performance e-graph engine
… and reduce memory usage. The second, trie query planning, amortizes index lookups across rewrite rules during e-matching.
-
Query answering in distributed RDF databases
… in a cluster of shared-nothing servers, and to query the data using a distributed query algorithm. Existing approaches typically use a variant of the <em>data exchange operator</em> to shuffle partial query answers between servers and thus ensure that every query answer is produced. Decisions as …
-
Enabling semantically richer queries over unstructured data
Querying unstructured data such as video, audio, and text is critical for domains ranging from traffic surveillance to healthcare and finance. Modern AI models (e.g., vision and language models) unlock significant potential for extracting fine-grained information from such data. However, current …
-
Optimizing query answering over expressive ontological knowledge
Query answering over ontologies, i.e., the computation of answers to user queriesbased not only on explicitly stated information but also on implicit knowledge is animportant task in the context of the Semantic Web. In this direction, the SPARQLquery language has recently been extended by the World …
-
Relational Computing Using HPC Resources: Services and Optimizations
… We also propose an optimization upgrade to the query planning module of postgres-XC, the core relational data processing engine of the DiceX framework. With a knowledge of domain semantics, we have devised a more robust data distribution strategy that would enable to push down most time …
-
Federated SPARQL Query Processing Reconciling Diversity, Flexibility and Performance on the Web of Data
Querying the ever-growing Web of Data poses a significant challenge in today’s Semantic Web. The complete lack of any centralised control leads to potentially arbitrary data distribution, high variability of latency between hosts participating in query answering, and, in the extreme, even the …
-
Towards Energy and Power Efficient Data Stores
… energy of server systems and by optimizing query planning under peak shaving constraints thereby maintaining performance and in some cases show better performance by choosing a better query plan for an SQL query. As memory becomes cheaper, use of it has become more prominent in computer …
-
Towards Efficient Spatial and Textual Query Processing: Learned Indexing and Cardinality Estimation
… rather than exploring the potential of data and query workload. In addition, traditional indexes also utilize the heuristic hand-crafted function to guide index construction, which might lead to a sub-optimal structure. On the other hand, accurate cardinality estimation plays a key role when …