Cache-efficient sweeping-based interval joins for extended Allen relation predicates
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
0949-877X
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
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
- Urheber
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00778-020-00650-5
- URN
-
urn:nbn:de:101:1-2021040412142257508802
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:58 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Piatov, Danila
- Helmer, Sven
- Dignös, Anton
- Persia, Fabio
- SpringerLink (Online service)
Ähnliche Objekte (12)
In-Memory Interval Joins
In-Memory Interval Joins
Fast interval joins for temporal SPARQL queries
Evaluation of Main Memory : Join Algorithms for Joins with Set Comparison Predicates
Leveraging range joins for the computation of overlap joins
Joins and intersections
TID Hash Joins
Cache-cache
Cache-Cache
Practical Query Rewriting for DL-Lite with Numerical Predicates : Extended Version
Parallelizing Set Similarity Joins
Cupid Joins the War
In-Memory Interval Joins
In-Memory Interval Joins
Fast interval joins for temporal SPARQL queries
Evaluation of Main Memory : Join Algorithms for Joins with Set Comparison Predicates
Leveraging range joins for the computation of overlap joins
Joins and intersections
TID Hash Joins
Cache-cache
Cache-Cache
Practical Query Rewriting for DL-Lite with Numerical Predicates : Extended Version
Parallelizing Set Similarity Joins
Cupid Joins the War
In-Memory Interval Joins
In-Memory Interval Joins
Fast interval joins for temporal SPARQL queries
Evaluation of Main Memory : Join Algorithms for Joins with Set Comparison Predicates
Leveraging range joins for the computation of overlap joins
Joins and intersections
TID Hash Joins
Cache-cache
Cache-Cache
Practical Query Rewriting for DL-Lite with Numerical Predicates : Extended Version
Parallelizing Set Similarity Joins