Cache-efficient sweeping-based interval joins for extended Allen relation predicates

to related objects

Location
Deutsche Nationalbibliothek Frankfurt am Main
ISSN
0949-877X
Extent
Online-Ressource
Language
Englisch
Notes
online resource.

Bibliographic citation
Cache-efficient sweeping-based interval joins for extended Allen relation predicates ; day:13 ; month:2 ; year:2021 ; pages:1-24
The VLDB journal ; (13.2.2021), 1-24

Creator
Piatov, Danila
Helmer, Sven
Dignös, Anton
Persia, Fabio
Contributor
SpringerLink (Online service)

DOI
10.1007/s00778-020-00650-5
URN
urn:nbn:de:101:1-2021040412142257508802
Rights
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
Last update
14.08.2025, 10:58 AM CEST

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Show original at data provider

Associated

  • Piatov, Danila
  • Helmer, Sven
  • Dignös, Anton
  • Persia, Fabio
  • SpringerLink (Online service)

Other Objects (12)

In-Memory Interval Joins

In-Memory Interval Joins

In-Memory Interval Joins

In-Memory Interval Joins

Fast interval joins for temporal SPARQL queries

Fast interval joins for temporal SPARQL queries

Evaluation of Main Memory : Join Algorithms for Joins with Set Comparison Predicates

Evaluation of Main Memory : Join Algorithms for Joins with Set Comparison Predicates

Leveraging range joins for the computation of overlap joins

Leveraging range joins for the computation of overlap joins

Joins and intersections

Joins and intersections

TID Hash Joins

TID Hash Joins

Cache-cache

Druckgraphik

Cache-cache

Cache-Cache

Noten (Musik)

Cache-Cache

Practical Query Rewriting for DL-Lite with Numerical Predicates : Extended Version

Practical Query Rewriting for DL-Lite with Numerical Predicates : Extended Version

Parallelizing Set Similarity Joins

Parallelizing Set Similarity Joins

Cupid Joins the War

Cupid Joins the War

Related objects