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 23 for “"Query workloads"”.
-
A Design and Implementation of Learned Index for Processing Multi-Dimensional Queries Over Relational Data
… and data layout based on data distribution and query workloads. We identify and evaluate the core components of the Flood framework—including grid-based partitioning, learned layout optimization, and refinement steps—and assess the impact of each component on overall system performance. We …
-
Cardinality Learning under Practical Constraints: Principled Theory and Empirical Design
… queries --- is a core component of effective query optimization and has remained one of the most important problems in database management systems (DBMSes) since the 1980s. Early approaches relied on basic statistics, such as histograms, together with uniformity and independence assumptions. …
-
Improving Efficiency, Expressiveness and Security of Searchable Encryption
… as range, join, group-by, as well as dynamic query workloads, and (iii) provide new adjustable security-efficiency trade-offs---leading to robust and efficient schemes even against very powerful adversaries.
-
Towards Automatic Generation of Smartphone Database Benchmarks through Workload characterization of smartphone databases
… a benchmarking tool which aims to emulate the workloads of Android applications to compare different mobile database management system implementations. First, we describe a clustering scheme where we analyze the query logs to group the SQL queries by semantic similarity. Then, we introduce a …
-
Learning from SQL: Database Agnostic Workload Management
… ignore the wealth of information present in SQL query workloads. In this work, we present a vision for database agnostic workload management. We start by providing an architecture for the SQLShare platform, a database-as-a-service built for researchers with minimal database experience. We …
-
Native Graph Support in Relational Data Systems
… to scale for large graphs and heavy query-workloads, the state-of-the-art approaches pre-construct indexing structures to improve query latency. However, updates that dynamically change the underlying graphs may frequently invalidate these costly pre-constructed indexes. This …
-
Workload based summaries for knowledge graphs
… vast datasets into manageable sizes, optimizing query answering, indexing, and visualization. Recent developments in structural semantic summaries have focused on extracting central nodes from the semantic graph, exploiting several graph centrality measures, then linking them and presenting them …
-
Link Prediction in Agent-based Graph Database System
… outperform it in execution time on large-scale query workloads. FastRP embeddings are generated via an agent-driven propagation pipeline that mirrors adjacency-based diffusion, enabling fullgraph vector generation in distributed environments. Though the current FastRP + kNN pipeline in MASS …
-
Adaptive Indexing for Complex Data
… can be costly and inefficient, particularly when query volumes are low or have unpredictable patterns. Adaptive indexing addresses this challenge by dynamically building and optimizing an index incrementally, following the query workload. This approach ensures that the indexing structure evolves …
-
Reducing the Overhead of Memory Space, Network Communication and Disk I/O for Analytic Frameworks in Big Data Ecosystem
… systems are not adaptive to dynamic query workloads and online sampling based approximation systems suffer from low I/O efficiency and poor estimation accuracy. Therefore, we develop a distribution aware method called Sapprox. Our idea is to collect the occurrences of a sub-dataset at …
-
Distributed Real-Time Analysis of High-Velocity Many-Dimensional Data Sets
… or generate separate indices in order to query the database. Data is distributed across many machines, and the system can grow or shrink dynamically to accommodate changing load. The distribution of data is dynamically adjusted to maintain performance and provide fault-tolerance without …
-
Join Cardinality Estimation Graphs: Analyzing Pessimistic and Optimistic Estimators Through a Common Lens
… is a fundamental problem that is solved in the query optimizers of database management systems when generating efficient query plans. This problem arises both in systems that manage relational data as well those that manage graph-structured data where systems need to estimate the cardinalities …
-
Kite: A Scalable Microblogs Data Management System
… flushing policies that are designed for top-k query workloads, which are popular on microblogs data. Both in-memory and in-disk data are queried seamlessly through efficient retrieval techniques that are encapsulated in Kite query processor. The query processor exploits the top-k ranking …
-
Managing, querying and analyzing big data on the web
… Framework (RDF) model and its associated SPARQL query language. To this end, we focus in three directions, namely (i) RDF data evolution, (ii) storage, indexing and query optimization in RDF/SPARQL engines, and (iii) efficient and scalable information retrieval from multidimensional RDF datasets. …
-
A Workload-Driven Framework for NoSQL Data Modeling and Partitioning
… logical schema from the conceptual model and query workload of the system. Then it converts the generic schema to the schemas of targeted NoSQL data models regarding their important features and design trade-offs between the read query performance and storage overhead or consistency …
-
A Novel GPU Algorithm for Indexing Columnar Databases with Column Imprints
… more appropriate for data warehouses because query workloads for the latter systems usually involve retrieving all the values of a small subset of attributes. \par Just like in relational database management systems, query response time performance in CDBMS can greatly benefit from the …
-
On the impact of separated storage and compute for data processing
The technological advancements for storing and querying data have led to the rise of a society driven by digital information and communication technologies. The ever-growing interest for information and the advantages of cloud computing have motivated companies and people to move their data into …
-
Wavelet-based algorithms for approximate processing in the big data era
… emphasis on the efficiency of approximate query processing (AQP). A common practice for enabling AQP is to construct a lossy, compressed representation of a dataset and execute user queries against these synopses instead of the original data. A major challenge over the past years has been …
-
Distributed XML Query Processing
While centralized query processing over collections of XML data stored at a single site is a well understood problem, centralized query evaluation techniques are inherently limited in their scalability when presented with large collections (or a single, large document) and heavy query workloads. In …
-
Indexing for Very Large Data Series Collections
… tailored to solve the problem of indexing and querying very large data series collections. The main idea is that instead of building the complete index over the complete data set up-front and querying only later, we interactively and adaptively build parts of the index, only for the parts of …
Page 1 of 2