Please use this identifier to cite or link to this item:
http://doi.org/10.25358/openscience-9483Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Christodoulou, George | - |
| dc.contributor.author | Bouros, Panagiotis | - |
| dc.contributor.author | Mamoulis, Nikos | - |
| dc.date.accessioned | 2023-08-24T10:08:40Z | - |
| dc.date.available | 2023-08-24T10:08:40Z | - |
| dc.date.issued | 2023 | - |
| dc.identifier.uri | https://openscience.ub.uni-mainz.de/handle/20.500.12030/9501 | - |
| dc.description.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. | en_GB |
| dc.description.sponsorship | Deutsche Forschungsgemeinschaft (DFG)|491381577|Open-Access-Publikationskosten 2022–2024 Universität Mainz - Universitätsmedizin | - |
| dc.language.iso | eng | de |
| dc.rights | CC BY | * |
| dc.rights.uri | https://creativecommons.org/licenses/by/4.0/ | * |
| dc.subject.ddc | 004 Informatik | de_DE |
| dc.subject.ddc | 004 Data processing | en_GB |
| dc.title | HINT: a hierarchical interval index for Allen relationships | en_GB |
| dc.type | Zeitschriftenaufsatz | de |
| dc.identifier.doi | http://doi.org/10.25358/openscience-9483 | - |
| jgu.type.dinitype | article | en_GB |
| jgu.type.version | Published version | de |
| jgu.type.resource | Text | de |
| jgu.organisation.department | FB 08 Physik, Mathematik u. Informatik | de |
| jgu.organisation.number | 7940 | - |
| jgu.organisation.name | Johannes Gutenberg-Universität Mainz | - |
| jgu.rights.accessrights | openAccess | - |
| jgu.journal.title | The VLDB journal | de |
| jgu.journal.volume | Version of Record (VoR) | de |
| jgu.publisher.year | 2023 | - |
| jgu.publisher.name | Springer | de |
| jgu.publisher.place | Berlin u.a. | de |
| jgu.publisher.issn | 1066-8888 | de |
| jgu.organisation.place | Mainz | - |
| jgu.subject.ddccode | 004 | de |
| dc.date.updated | 2023-08-15T12:23:21Z | - |
| jgu.publisher.doi | 10.1007/s00778-023-00798-w | de |
| elements.object.id | 158338 | - |
| elements.object.labels | Interval data | - |
| elements.object.labels | Query processing | - |
| elements.object.labels | Indexing | - |
| elements.object.labels | Main memory | - |
| elements.object.labels | Allen's algebra | - |
| elements.object.labels | 0804 Data Format | - |
| elements.object.labels | 0805 Distributed Computing | - |
| elements.object.labels | 0806 Information Systems | - |
| elements.object.labels | Information Systems | - |
| elements.object.labels | 4605 Data management and data science | - |
| elements.object.type | journal-article | - |
| jgu.organisation.ror | https://ror.org/023b0x485 | - |
| Appears in collections: | DFG-491381577-H | |
Files in This Item:
| File | Description | Size | Format | ||
|---|---|---|---|---|---|
 | hint__a_hierarchical_interval-20230815142323059.pdf | Published version | 2.65 MB | Adobe PDF | View/Open |