Autoren:	Christodoulou, George Bouros, Panagiotis Mamoulis, Nikos
Titel:	HINT: a hierarchical interval index for Allen relationships
Online-Publikationsdatum:	24-Aug-2023
Erscheinungsdatum:	2023
Sprache des Dokuments:	Englisch
Zusammenfassung/Abstract:	Indexing intervals is a fundamental problem, finding a wide range of applications, most notably in temporal and uncertain databases. We propose HINT, a novel and efficient in-memory index for range selection queries over interval collections. HINT applies a hierarchical partitioning approach, which assigns each interval to at most two partitions per level and has controlled space requirements. We reduce the information stored at each partition to the absolutely necessary by dividing the intervals in it, based on whether they begin inside or before the partition boundaries. In addition, our index includes storage optimization techniques for the effective handling of data sparsity and skewness. We show how HINT can be used to efficiently process queries based on Allen’s relationships. Experiments on real and synthetic interval sets of different characteristics show that HINT is typically one order of magnitude faster than existing interval indexing methods.
DDC-Sachgruppe:	004 Informatik 004 Data processing
Veröffentlichende Institution:	Johannes Gutenberg-Universität Mainz
Organisationseinheit:	FB 08 Physik, Mathematik u. Informatik
Veröffentlichungsort:	Mainz
ROR:	https://ror.org/023b0x485
DOI:	http://doi.org/10.25358/openscience-9483
Version:	Published version
Publikationstyp:	Zeitschriftenaufsatz
Nutzungsrechte:	CC BY
Informationen zu den Nutzungsrechten:	https://creativecommons.org/licenses/by/4.0/
Zeitschrift:	The VLDB journal Version of Record (VoR)
Verlag:	Springer
Verlagsort:	Berlin u.a.
Erscheinungsdatum:	2023
ISSN:	1066-8888
DOI der Originalveröffentlichung:	10.1007/s00778-023-00798-w
Enthalten in den Sammlungen:	DFG-491381577-H