# Disjoint interval partitioning

Disjoint interval partitioning In databases with time interval attributes, query processing techniques that are based on sort-merge or sort-aggregate deteriorate. This happens because for intervals no total order exists and either the start or end point is used for the sorting. Doing so leads to inefficient solutions with lots of unproductive comparisons that do not produce an output tuple. Even if just one tuple with a long interval is present in the data, the number of unproductive comparisons of sort-merge and sort-aggregate gets quadratic. In this paper we propose disjoint interval partitioning ( $$\mathcal {DIP}$$ DIP ), a technique to efficiently perform sort-based operators on interval data. $$\mathcal {DIP}$$ DIP divides an input relation into the minimum number of partitions, such that all tuples in a partition are non-overlapping. The absence of overlapping tuples guarantees efficient sort-merge computations without backtracking. With $$\mathcal {DIP}$$ DIP the number of unproductive comparisons is linear in the number of partitions. In contrast to current solutions with inefficient random accesses to the active tuples, $$\mathcal {DIP}$$ DIP fetches the tuples in a partition sequentially. We illustrate the generality and efficiency of $$\mathcal {DIP}$$ DIP by describing and evaluating three basic database operators over interval data: join, anti-join and aggregation. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png The VLDB Journal Springer Journals

# Disjoint interval partitioning

, Volume 26 (3) – Feb 22, 2017
20 pages

/lp/springer_journal/disjoint-interval-partitioning-0QCj83uoDl
Publisher
Springer Berlin Heidelberg
Subject
Computer Science; Database Management
ISSN
1066-8888
eISSN
0949-877X
D.O.I.
10.1007/s00778-017-0456-7
Publisher site
See Article on Publisher Site

### Abstract

In databases with time interval attributes, query processing techniques that are based on sort-merge or sort-aggregate deteriorate. This happens because for intervals no total order exists and either the start or end point is used for the sorting. Doing so leads to inefficient solutions with lots of unproductive comparisons that do not produce an output tuple. Even if just one tuple with a long interval is present in the data, the number of unproductive comparisons of sort-merge and sort-aggregate gets quadratic. In this paper we propose disjoint interval partitioning ( $$\mathcal {DIP}$$ DIP ), a technique to efficiently perform sort-based operators on interval data. $$\mathcal {DIP}$$ DIP divides an input relation into the minimum number of partitions, such that all tuples in a partition are non-overlapping. The absence of overlapping tuples guarantees efficient sort-merge computations without backtracking. With $$\mathcal {DIP}$$ DIP the number of unproductive comparisons is linear in the number of partitions. In contrast to current solutions with inefficient random accesses to the active tuples, $$\mathcal {DIP}$$ DIP fetches the tuples in a partition sequentially. We illustrate the generality and efficiency of $$\mathcal {DIP}$$ DIP by describing and evaluating three basic database operators over interval data: join, anti-join and aggregation.

### Journal

The VLDB JournalSpringer Journals

Published: Feb 22, 2017

## You’re reading a free preview. Subscribe to read the entire article.

### DeepDyve is your personal research library

It’s your single place to instantly
that matters to you.

over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month ### Explore the DeepDyve Library ### Search Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly ### Organize Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place. ### Access Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals. ### Your journals are on DeepDyve Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more. All the latest content is available, no embargo periods. DeepDyve ### Freelancer DeepDyve ### Pro Price FREE$49/month
\$360/year

Save searches from
PubMed

Create lists to

Export lists, citations