We consider the problem of indexing general database workloads (combinations of data sets and sets of potential queries). We define a framework for measuring the efficiency of an indexing scheme for a workload based on two characterizations: storage redundancy (how many times each item in the data set is stored), and access overhead (how many times more blocks than necessary does a query retrieve). Using this framework we present some initial results, showing upper and lower bounds and trade-offs between them in the case of multi-dimensional range queries and set queries. 1 Introduction The success and ubiquity of the relational data model arguably owes much to the B-tree, the access method breakthrough that accompanied it with superb timi...
Workload-aware physical data access structures are crucial to achieve short response time with (expl...
Commercial off-the-shelf DataBase Management Systems (DBMSes) are highly optimized to process a wide...
Commercial off-the-shelf DataBase Management Systems (DBMSes) are highly optimized to process a wide...
Summarization: We develop a theoretical framework to characterize the hardness of indexing data sets...
Wide range of indexing techniques exists in the world of relational database. Speed of data insertio...
textIn the last decade, the relational data model has been extended in numerous ways, including geo...
One-dimensional range queries, as one of the most basic type of queries in databases, have been stud...
AbstractÐPast R-tree studies have focused on the number of nodes visited as a metric of query perfor...
Summarization: Indexing schemes were proposed by Hellerstein, Koutsoupias and Fapadlmitriou [7] to m...
In this chapter, we explore ways to answer queries on large multi-dimensional data efficiently. Giv...
: In this paper we present an analytical model that predicts the performance of R-trees (and its var...
This article investigates MySQL's index capabilities. It begins by reviewing how indexes work, as we...
This article investigates MySQL's index capabilities. It begins by reviewing how indexes work, as we...
In this paper we present MAP21, an indexing structure for ranges. The main idea is to map a bounded ...
The B-tree is a fundamental external index structure that is widely used for answering one-dimension...
Workload-aware physical data access structures are crucial to achieve short response time with (expl...
Commercial off-the-shelf DataBase Management Systems (DBMSes) are highly optimized to process a wide...
Commercial off-the-shelf DataBase Management Systems (DBMSes) are highly optimized to process a wide...
Summarization: We develop a theoretical framework to characterize the hardness of indexing data sets...
Wide range of indexing techniques exists in the world of relational database. Speed of data insertio...
textIn the last decade, the relational data model has been extended in numerous ways, including geo...
One-dimensional range queries, as one of the most basic type of queries in databases, have been stud...
AbstractÐPast R-tree studies have focused on the number of nodes visited as a metric of query perfor...
Summarization: Indexing schemes were proposed by Hellerstein, Koutsoupias and Fapadlmitriou [7] to m...
In this chapter, we explore ways to answer queries on large multi-dimensional data efficiently. Giv...
: In this paper we present an analytical model that predicts the performance of R-trees (and its var...
This article investigates MySQL's index capabilities. It begins by reviewing how indexes work, as we...
This article investigates MySQL's index capabilities. It begins by reviewing how indexes work, as we...
In this paper we present MAP21, an indexing structure for ranges. The main idea is to map a bounded ...
The B-tree is a fundamental external index structure that is widely used for answering one-dimension...
Workload-aware physical data access structures are crucial to achieve short response time with (expl...
Commercial off-the-shelf DataBase Management Systems (DBMSes) are highly optimized to process a wide...
Commercial off-the-shelf DataBase Management Systems (DBMSes) are highly optimized to process a wide...