Temporal data management–an overview

MH Böhlen, A Dignös, J Gamper, CS Jensen - Business Intelligence and …, 2018 - Springer
Despite the ubiquity of temporal data and considerable research on the effective and
efficient processing of such data, database systems largely remain designed for processing …

[图书][B] Encyclopedia of information science and technology

DBA Khosrow-Pour - 2005 - books.google.com
Technology is constantly changing; what is cutting edge today is obsolete tomorrow. In this
ever-evolving environment, educators, researchers and professionals of the discipline need …

How does knowledge evolve in open knowledge graphs?

A Polleres, R Pernisch, A Bonifati, D Dell'Aglio… - Transactions on Graph …, 2023 - hal.science
Openly available, collaboratively edited Knowledge Graphs (KGs) are key platforms for the
collective management of evolving knowledge. The present work aims to provide an …

Overlap interval partition join

A Dignös, MH Böhlen, J Gamper - Proceedings of the 2014 ACM …, 2014 - dl.acm.org
Each tuple in a valid-time relation includes an interval attribute T that represents the tuple's
valid time. The overlap join between two valid-time relations determines all pairs of tuples …

Extending the kernel of a relational DBMS with comprehensive support for sequenced temporal queries

A Dignös, MH Böhlen, J Gamper… - ACM Transactions on …, 2016 - dl.acm.org
Many databases contain temporal, or time-referenced, data and use intervals to capture the
temporal aspect. While SQL-based database management systems (DBMSs) are capable of …

Temporal graph algebra

VZ Moffitt, J Stoyanovich - … of The 16th International Symposium on …, 2017 - dl.acm.org
Graph representations underlie many modern computer applications, capturing the structure
of such diverse networks as the Internet, personal associations, roads, sensors, and …

Lifted dynamic junction tree algorithm

M Gehrke, T Braun, R Möller - … Structures, ICCS 2018, Edinburgh, UK, June …, 2018 - Springer
Probabilistic models involving relational and temporal aspects need exact and efficient
inference algorithms. Existing approaches are approximative, include unnecessary …

Disjoint interval partitioning

F Cafagna, MH Böhlen - The VLDB Journal, 2017 - Springer
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 …

A temporal-probabilistic database model for information extraction

M Dylla, I Miliaraki, M Theobald - Proceedings of the VLDB Endowment, 2013 - dl.acm.org
Temporal annotations of facts are a key component both for building a high-accuracy
knowledge base and for answering queries over the resulting temporal knowledge base …

[HTML][HTML] Leveraging range joins for the computation of overlap joins

A Dignös, MH Böhlen, J Gamper, CS Jensen… - The VLDB Journal, 2022 - Springer
Joins are essential and potentially expensive operations in database management systems.
When data is associated with time periods, joins commonly include predicates that require …