The Experts below are selected from a list of 39 Experts worldwide ranked by ideXlab platform

Petrov Ilia - One of the best experts on this subject based on the ideXlab platform.

  • MV-PBT: multi-version indexing for large datasets and HTAP workloads
    Konstanz Germany : Open Proceedings.org Univ. of Konstanz, 2020
    Co-Authors: Riegger Christian, Vincon Tobias, Gottstein Robert, Petrov Ilia
    Abstract:

    Modern mixed (HTAP)workloads execute fast update-transactions and long running analytical queries on the same dataset and system. In multi-version (MVCC) systems, such workloads result in many short-lived versions and long version-chains as well as in increased and frequent maintenance overhead. Consequently, the index pressure increases significantly. Firstly, the frequent modifications cause frequent creation of new versions, yielding a surge in index maintenance overhead. Secondly and more importantly, index-scans incur extra I/O overhead to determine, which of the resulting tuple versions are visible to the executing transaction (visibility-check) as current designs only store version/Timestamp Information in the base table – not in the index. Such index-only visibility-check is critical for HTAP workloads on large datasets. In this paper we propose the Multi Version Partitioned B-Tree (MV-PBT) as a version-aware index structure, supporting index-only visibility checks and flash-friendly I/O patterns. The experimental evaluation indicates a 2x improvement for analytical queries and 15% higher transactional throughput under HTAP workloads. MV-PBT offers 40% higher tx. throughput compared to WiredTiger’s LSM-Tree implementation under YCSB

  • MV-PBT: Multi-Version Index for Large Datasets and HTAP Workloads
    2019
    Co-Authors: Riegger Christian, Vincon Tobias, Gottstein Robert, Petrov Ilia
    Abstract:

    Modern mixed (HTAP) workloads execute fast update-transactions and long-running analytical queries on the same dataset and system. In multi-version (MVCC) systems, such workloads result in many short-lived versions and long version-chains as well as in increased and frequent maintenance overhead. Consequently, the index pressure increases significantly. Firstly, the frequent modifications cause frequent creation of new versions, yielding a surge in index maintenance overhead. Secondly and more importantly, index-scans incur extra I/O overhead to determine, which of the resulting tuple-versions are visible to the executing transaction (visibility-check) as current designs only store version/Timestamp Information in the base table -- not in the index. Such index-only visibility-check is critical for HTAP workloads on large datasets. In this paper we propose the Multi-Version Partitioned B-Tree (MV-PBT) as a version-aware index structure, supporting index-only visibility checks and flash-friendly I/O patterns. The experimental evaluation indicates a 2x improvement for analytical queries and 15% higher transactional throughput under HTAP workloads (CH-Benchmark). MV-PBT offers 40% higher transactional throughput compared to WiredTiger's LSM-Tree implementation under YCSB

Wil M P Van Der Aalst - One of the best experts on this subject based on the ideXlab platform.

  • detection and interactive repair of event ordering imperfection in process logs
    Conference on Advanced Information Systems Engineering, 2018
    Co-Authors: Prabhakar M Dixit, Suriadi Suriadi, Robert Andrews, Moe Thandar Wynn, Arthur H M Ter Hofstede, Jcam Joos Buijs, Wil M P Van Der Aalst
    Abstract:

    Many forms of data analysis require Timestamp Information to order the occurrences of events. The process mining discipline uses historical records of process executions, called event logs, to derive insights into business process behaviours and performance. Events in event logs must be ordered, typically achieved using Timestamps. The importance of Timestamp Information means that it needs to be of high quality. To the best of our knowledge, no (semi-)automated support exists for detecting and repairing ordering-related imperfection issues in event logs. We describe a set of Timestamp-based indicators for detecting event ordering imperfection issues in a log and our approach to repairing identified issues using domain knowledge. Lastly, we evaluate our approach implemented in the open-source process mining framework, ProM, using two publicly available logs.

Riegger Christian - One of the best experts on this subject based on the ideXlab platform.

  • MV-PBT: multi-version indexing for large datasets and HTAP workloads
    Konstanz Germany : Open Proceedings.org Univ. of Konstanz, 2020
    Co-Authors: Riegger Christian, Vincon Tobias, Gottstein Robert, Petrov Ilia
    Abstract:

    Modern mixed (HTAP)workloads execute fast update-transactions and long running analytical queries on the same dataset and system. In multi-version (MVCC) systems, such workloads result in many short-lived versions and long version-chains as well as in increased and frequent maintenance overhead. Consequently, the index pressure increases significantly. Firstly, the frequent modifications cause frequent creation of new versions, yielding a surge in index maintenance overhead. Secondly and more importantly, index-scans incur extra I/O overhead to determine, which of the resulting tuple versions are visible to the executing transaction (visibility-check) as current designs only store version/Timestamp Information in the base table – not in the index. Such index-only visibility-check is critical for HTAP workloads on large datasets. In this paper we propose the Multi Version Partitioned B-Tree (MV-PBT) as a version-aware index structure, supporting index-only visibility checks and flash-friendly I/O patterns. The experimental evaluation indicates a 2x improvement for analytical queries and 15% higher transactional throughput under HTAP workloads. MV-PBT offers 40% higher tx. throughput compared to WiredTiger’s LSM-Tree implementation under YCSB

  • MV-PBT: Multi-Version Index for Large Datasets and HTAP Workloads
    2019
    Co-Authors: Riegger Christian, Vincon Tobias, Gottstein Robert, Petrov Ilia
    Abstract:

    Modern mixed (HTAP) workloads execute fast update-transactions and long-running analytical queries on the same dataset and system. In multi-version (MVCC) systems, such workloads result in many short-lived versions and long version-chains as well as in increased and frequent maintenance overhead. Consequently, the index pressure increases significantly. Firstly, the frequent modifications cause frequent creation of new versions, yielding a surge in index maintenance overhead. Secondly and more importantly, index-scans incur extra I/O overhead to determine, which of the resulting tuple-versions are visible to the executing transaction (visibility-check) as current designs only store version/Timestamp Information in the base table -- not in the index. Such index-only visibility-check is critical for HTAP workloads on large datasets. In this paper we propose the Multi-Version Partitioned B-Tree (MV-PBT) as a version-aware index structure, supporting index-only visibility checks and flash-friendly I/O patterns. The experimental evaluation indicates a 2x improvement for analytical queries and 15% higher transactional throughput under HTAP workloads (CH-Benchmark). MV-PBT offers 40% higher transactional throughput compared to WiredTiger's LSM-Tree implementation under YCSB

Prabhakar M Dixit - One of the best experts on this subject based on the ideXlab platform.

  • detection and interactive repair of event ordering imperfection in process logs
    Conference on Advanced Information Systems Engineering, 2018
    Co-Authors: Prabhakar M Dixit, Suriadi Suriadi, Robert Andrews, Moe Thandar Wynn, Arthur H M Ter Hofstede, Jcam Joos Buijs, Wil M P Van Der Aalst
    Abstract:

    Many forms of data analysis require Timestamp Information to order the occurrences of events. The process mining discipline uses historical records of process executions, called event logs, to derive insights into business process behaviours and performance. Events in event logs must be ordered, typically achieved using Timestamps. The importance of Timestamp Information means that it needs to be of high quality. To the best of our knowledge, no (semi-)automated support exists for detecting and repairing ordering-related imperfection issues in event logs. We describe a set of Timestamp-based indicators for detecting event ordering imperfection issues in a log and our approach to repairing identified issues using domain knowledge. Lastly, we evaluate our approach implemented in the open-source process mining framework, ProM, using two publicly available logs.

Vincon Tobias - One of the best experts on this subject based on the ideXlab platform.

  • MV-PBT: multi-version indexing for large datasets and HTAP workloads
    Konstanz Germany : Open Proceedings.org Univ. of Konstanz, 2020
    Co-Authors: Riegger Christian, Vincon Tobias, Gottstein Robert, Petrov Ilia
    Abstract:

    Modern mixed (HTAP)workloads execute fast update-transactions and long running analytical queries on the same dataset and system. In multi-version (MVCC) systems, such workloads result in many short-lived versions and long version-chains as well as in increased and frequent maintenance overhead. Consequently, the index pressure increases significantly. Firstly, the frequent modifications cause frequent creation of new versions, yielding a surge in index maintenance overhead. Secondly and more importantly, index-scans incur extra I/O overhead to determine, which of the resulting tuple versions are visible to the executing transaction (visibility-check) as current designs only store version/Timestamp Information in the base table – not in the index. Such index-only visibility-check is critical for HTAP workloads on large datasets. In this paper we propose the Multi Version Partitioned B-Tree (MV-PBT) as a version-aware index structure, supporting index-only visibility checks and flash-friendly I/O patterns. The experimental evaluation indicates a 2x improvement for analytical queries and 15% higher transactional throughput under HTAP workloads. MV-PBT offers 40% higher tx. throughput compared to WiredTiger’s LSM-Tree implementation under YCSB

  • MV-PBT: Multi-Version Index for Large Datasets and HTAP Workloads
    2019
    Co-Authors: Riegger Christian, Vincon Tobias, Gottstein Robert, Petrov Ilia
    Abstract:

    Modern mixed (HTAP) workloads execute fast update-transactions and long-running analytical queries on the same dataset and system. In multi-version (MVCC) systems, such workloads result in many short-lived versions and long version-chains as well as in increased and frequent maintenance overhead. Consequently, the index pressure increases significantly. Firstly, the frequent modifications cause frequent creation of new versions, yielding a surge in index maintenance overhead. Secondly and more importantly, index-scans incur extra I/O overhead to determine, which of the resulting tuple-versions are visible to the executing transaction (visibility-check) as current designs only store version/Timestamp Information in the base table -- not in the index. Such index-only visibility-check is critical for HTAP workloads on large datasets. In this paper we propose the Multi-Version Partitioned B-Tree (MV-PBT) as a version-aware index structure, supporting index-only visibility checks and flash-friendly I/O patterns. The experimental evaluation indicates a 2x improvement for analytical queries and 15% higher transactional throughput under HTAP workloads (CH-Benchmark). MV-PBT offers 40% higher transactional throughput compared to WiredTiger's LSM-Tree implementation under YCSB