Gotowe bibliografie tematyczne / Multi-Version Concurrency Control (MVCC) / Artykuły w czasopismach
Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Multi-Version Concurrency Control (MVCC).

Artykuły w czasopismach na temat „Multi-Version Concurrency Control (MVCC)”

Autor: Grafiati
Data publikacji: 2 czerwca 2025
Data aktualizacji: 31 lipca 2025

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 19 najlepszych artykułów w czasopismach naukowych na temat „Multi-Version Concurrency Control (MVCC)”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Przeglądaj artykuły w czasopismach z różnych dziedzin i twórz odpowiednie bibliografie.

1

Голенев, А. В. "Принципы построения отказоустойчивых распределенных баз данных для финтех-индустрии". Journal of Applied Research, № 5 (19 травня 2025): 21–26. https://doi.org/10.47576/2949-1878.2025.5.5.002.

Pełny tekst źródła
Streszczenie:
В статье рассматриваются существующие технологии обеспечения отказоустойчивости, безопасности в распределенных базах данных для финтех-индустрии, ориентированные на транзакционные нагрузки. Используются протоколы консенсуса, такие как Raft, Paxos, которые гарантируют согласованность данных при репликации, повышают устойчивость к сбоям. Внедрение шардинга (разделения данных на фрагменты) позволяет оптимизировать скорость доступа к данным, а также избежать перегрузки серверов, что необходимо для операций с объемами высокочастотных транзакций. Обсуждается поддержка ACID-транзакций, изоляции на ос
Style APA, Harvard, Vancouver, ISO itp.
2

Guo, Rentong, Xiaofan Luan, Long Xiang, et al. "Manu." Proceedings of the VLDB Endowment 15, no. 12 (2022): 3548–61. http://dx.doi.org/10.14778/3554821.3554843.

Pełny tekst źródła
Streszczenie:
With the development of learning-based embedding models, embedding vectors are widely used for analyzing and searching unstructured data. As vector collections exceed billion-scale, fully managed and horizontally scalable vector databases are necessary. In the past three years, through interaction with our 1200+ industry users, we have sketched a vision for the features that next-generation vector databases should have, which include long-term evolvability, tunable consistency, good elasticity, and high performance. We present Manu, a cloud native vector database that implements these features
Style APA, Harvard, Vancouver, ISO itp.
3

Levandoski, Justin, David Lomet, Sudipta Sengupta, Ryan Stutsman, and Rui Wang. "Multi-version range concurrency control in Deuteronomy." Proceedings of the VLDB Endowment 8, no. 13 (2015): 2146–57. http://dx.doi.org/10.14778/2831360.2831368.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Hajar, Maseeh Yasin, and Ahmed Mahmoud Hisham. "Data Integrity and Consistency Challenges in Distributed Database Systems." Engineering and Technology Journal 10, no. 05 (2025): 5077–86. https://doi.org/10.5281/zenodo.15471862.

Pełny tekst źródła
Streszczenie:
With the advent of distributed computing, maintaining data consistency and integrity between geographically remote and logically divided systems has become one of the most significant challenges for system designers and database architects. Distributed databases, though they offer higher availability, scalability, and local autonomy, create problems in maintaining synchronized and consistent states of data. This work covers the Database Integrity (DDBI) project—a pioneering endeavor sponsored by Rome Laboratory and conducted at SRI International—where innovative methods such as rul
Style APA, Harvard, Vancouver, ISO itp.
5

Wu, Yingjun, Joy Arulraj, Jiexi Lin, Ran Xian, and Andrew Pavlo. "An empirical evaluation of in-memory multi-version concurrency control." Proceedings of the VLDB Endowment 10, no. 7 (2017): 781–92. http://dx.doi.org/10.14778/3067421.3067427.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Nguyen, Lam-Duy, Sang-Won Lee, and Beomseok Nam. "In-page shadowing and two-version timestamp ordering for mobile DBMSs." Proceedings of the VLDB Endowment 15, no. 11 (2022): 2402–14. http://dx.doi.org/10.14778/3551793.3551802.

Pełny tekst źródła
Streszczenie:
Increasing the concurrency level in mobile database systems has not received much attention, mainly because the concurrency requirements of mobile workloads has been regarded to be low. Contrary to popular belief, mobile workloads require higher concurrency. In this work, we propose novel journaling and concurrency mechanisms for mobile DBMSs, both of which build upon one common concept - In-Page Shadowing (IPS). We design and implement a novel In-Page Shadowing recovery method for SQLite to resolve the journaling of journal anomaly, which is known to quadruple the I/O traffic in mobile device
Style APA, Harvard, Vancouver, ISO itp.
7

Freitag, Michael, Alfons Kemper, and Thomas Neumann. "Memory-optimized multi-version concurrency control for disk-based database systems." Proceedings of the VLDB Endowment 15, no. 11 (2022): 2797–810. http://dx.doi.org/10.14778/3551793.3551832.

Pełny tekst źródła
Streszczenie:
Pure in-memory database systems offer outstanding performance but degrade heavily if the working set does not fit into DRAM, which is problematic in view of declining main memory growth rates. In contrast, recently proposed memory-optimized disk-based systems such as Umbra leverage large in-memory buffers for query processing but rely on fast solid-state disks for persistent storage. They offer near in-memory performance while the working set is cached, and scale gracefully to arbitrarily large data sets far beyond main memory capacity. Past research has shown that this architecture is indeed
Style APA, Harvard, Vancouver, ISO itp.
8

Leis, Viktor. "LeanStore: A High-Performance Storage Engine for NVMe SSDs." Proceedings of the VLDB Endowment 17, no. 12 (2024): 4536–45. http://dx.doi.org/10.14778/3685800.3685915.

Pełny tekst źródła
Streszczenie:
Neither traditional disk-based database systems nor modern inmemory database systems are capable of fully exploiting modern servers with multiple NVMe SSDs. LeanStore is a high-performance OLTP storage engine specifically optimized for NVMe SSDs and multi-core CPUs. The paper gives an overview of the architecture of LeanStore and describes all major components, covering caching, page replacement, I/O management, indexing, data structure synchronization, multi-version concurrency control, logging, checkpoints, and recovery. We also discuss some of the low-level implementation techniques necessa
Style APA, Harvard, Vancouver, ISO itp.
9

Vipul, Kumar Bondugula. "MANAGING CONFLICT RATE REDUCTION IN SCALABLE DISTRIBUTED DATABASE SYSTEMS." INTERNATIONAL JOURNAL OF INNOVATIVE RESEARCH AND CREATIVE TECHNOLOGY 9, no. 1 (2023): 1–23. https://doi.org/10.5281/zenodo.15356925.

Pełny tekst źródła
Streszczenie:
Databases are foundational components in modern computing systems, used to store, manage, and retrieve structured data efficiently. As data volumes and access requirements grow, traditional centralized databases often struggle to meet performance, availability, and fault tolerance demands. To address these limitations, distributed databases have emerged as a scalable solution, spreading data across multiple nodes or geographic locations. This architecture improves system resilience and enables faster access to data by colocating it closer to users. However, distributed databases also introduce
Style APA, Harvard, Vancouver, ISO itp.
10

Chen, Hongzhi, Changji Li, Chenguang Zheng, et al. "G-tran." Proceedings of the VLDB Endowment 15, no. 11 (2022): 2545–58. http://dx.doi.org/10.14778/3551793.3551813.

Pełny tekst źródła
Streszczenie:
Graph transaction processing poses unique challenges such as random data access due to the irregularity of graph structures, low throughput and high abort rate due to the relatively large read/write sets in graph transactions. To address these challenges, we present G-Tran, a remote direct memory access (RDMA)-enabled distributed in-memory graph database with serializable and snapshot isolation support. First, we propose a graph-native data store to achieve good data locality and fast data access for transactional updates and queries. Second, G-Tran adopts a fully decentralized architecture th
Style APA, Harvard, Vancouver, ISO itp.
11

Kraft, Peter, Qian Li, Xinjing Zhou, et al. "Epoxy: ACID Transactions across Diverse Data Stores." Proceedings of the VLDB Endowment 16, no. 11 (2023): 2742–54. http://dx.doi.org/10.14778/3611479.3611484.

Pełny tekst źródła
Streszczenie:
Developers are increasingly building applications that incorporate multiple data stores, for example to manage heterogeneous data. Often, these require transactional safety for operations across stores, but few systems support such guarantees. To solve this problem, we introduce Epoxy, a protocol for providing transactions across heterogeneous data stores. We make two contributions. First, we adapt multi-version concurrency control to a cross-data store setting, storing versioning information in record metadata and filtering reads with predicates on metadata so they only see record versions in
Style APA, Harvard, Vancouver, ISO itp.
12

Wang, Hengrui, Te Guo, Junzhao Yang, and Huanchen Zhang. "GRF: A Global Range Filter for LSM-Trees with Shape Encoding." Proceedings of the ACM on Management of Data 2, no. 3 (2024): 1–27. http://dx.doi.org/10.1145/3654944.

Pełny tekst źródła
Streszczenie:
Log-structured merge-trees (LSM-trees) are widely used in key-value stores because of its excellent write performance. To reduce LSM-tree's read amplification due to overlapping sorted runs, each file (i.e., SSTable) in an LSM-tree is typically associated with a point or range filter to reduce unnecessary I/Os to the runs that do not contain the target key (range). However, as modern SSDs get faster, probing multiple in-memory filters per query often makes the system CPU bottlenecked, thus compromising the system's throughput. In this paper, we developed the Global Range Filter (GRF) for Rocks
Style APA, Harvard, Vancouver, ISO itp.
13

-, Vipul Kumar Bondugula. "Storage Optimization in Distributed Environments using Optimistic Concurrency Control." International Journal on Science and Technology 15, no. 2 (2024). https://doi.org/10.71097/ijsat.v15.i2.4755.

Pełny tekst źródła
Streszczenie:
Multi-Version Concurrency Control (MVCC) is a database management technique that enables concurrent access to a database while maintaining consistency and isolation between transactions. By maintaining multiple versions of records, MVCC allows readers to access older versions of data while writers update the current version, ensuring that each transaction gets a consistent snapshot of the data without being blocked by others. This reduces the need for locks, allowing higher concurrency and better performance, especially in read-heavy environments. Each transaction is assigned a timestamp to de
Style APA, Harvard, Vancouver, ISO itp.
14

Ishtaiwi, Abdelraouf, Ahmad Nabot, Omar Alzubi, et al. "HECOCP: Hybrid Edge-Cloud Optimistic Concurrency Protocol for Sensor Data Transactional Services." International Arab Journal of Information Technology 22, no. 4 (2025). https://doi.org/10.34028/iajit/22/4/10.

Pełny tekst źródła
Streszczenie:
This paper proposes the Hybrid Edge-Cloud Optimistic Concurrency Protocol (HECOCP), a novel approach for efficiently managing distributed transactions on sensor data across both edge and cloud environments. By maintaining ACID properties and emphasizing local validation at edge nodes-with global validation triggered only when needed-HECOCP minimizes contention, lowers latency, and reduces transaction abort rates. Unlike established methods like Two-Phase Locking (2PL), prone to lock contention, or Multi-Version Concurrency Control (MVCC), which suffers version maintenance overhead, HECOCP achi
Style APA, Harvard, Vancouver, ISO itp.
15

"Multiversion Concurrency Control with the Precedence Graph Generation Algorithm." International Journal of Innovative Technology and Exploring Engineering 8, no. 9S2 (2019): 95–100. http://dx.doi.org/10.35940/ijitee.i1019.0789s219.

Pełny tekst źródła
Streszczenie:
Simultaneous access of a shared record by multiple transactions leads to conflicts while writing. Such scenario generates the problems like lost update, dirty read, nonrepeatable read etc . In such a case, transaction need to be rolled back to get the system into a consistent state. To handle these conflicts Multiversion Concurrency control (MVCC) is used. MVCC has the ability to avoid the read-write conflicts by performing the read operations using the older version when the write request is in progress. When the multiple write operation concurrently executes then the transaction is aborted o
Style APA, Harvard, Vancouver, ISO itp.
16

Onishi, Rina, Takashi Hoshino, and Hideyuki Kawashima. "EPO‐R: An efficient garbage collection scheme for long‐term transactions." Concurrency and Computation: Practice and Experience, May 4, 2024. http://dx.doi.org/10.1002/cpe.8134.

Pełny tekst źródła
Streszczenie:
SummaryThis article proposes EPO‐R, which is an efficient garbage collection scheme designed for multi‐version concurrency control (MVCC) protocols. MVCC generates a version for each update operation, and it can exhaust physical memory for dynamically changing environments such as IoT payments. Eager pruning of obsolete versions (EPO) is a novel garbage collection technique for long‐term transactions. We found room for improvement in EPO, which triggers reclamation invocation. EPO is triggered for each write operation, and it wastes CPU resources. The proposed method EPO‐R is triggered on a re
Style APA, Harvard, Vancouver, ISO itp.
17

"Multi-Version-Pulsating STM: A Multi-Version Optimistic Concurrency Control Scheme for Highly Parallel in-Memory Workload in a Multi Core Environment." International Journal of Engineering and Advanced Technology 9, no. 1 (2019): 1973–79. http://dx.doi.org/10.35940/ijeat.a9526.109119.

Pełny tekst źródła
Streszczenie:
Large in-memory data structures have a significant application in the fields of graphics, gaming, military and all the possible areas where Big Data can be employed. Their fame in the area of science and technology is attributable to fast in-memory access by the processor as compared to on-disk data structures. These enormous data structures can be accessed still fast and efficiently through parallel computing. For employing highly parallel computations, equally parallel algorithms are required. One of the most desirable attributes of such algorithms is their ability to control concurrency and
Style APA, Harvard, Vancouver, ISO itp.
18

"Effective Correctness Criteria for Serializability in Multiversion Concurrency Control Technique." International Journal of Innovative Technology and Exploring Engineering 8, no. 12 (2019): 1647–53. http://dx.doi.org/10.35940/ijitee.l3162.1081219.

Pełny tekst źródła
Streszczenie:
The Two-Phase Locking of Multi-Version Concurrency Control (MV2PL) avoids conflicts of concurrent transactions by make them wait until conflicts get resolved. These conflicts of transactions may generate starvations and deadlocks in the system. The Transactions suffering from deadlocks are usually aborted and restarted from scratch. In multiuser systems, this “abort and restart” approach degrades the system‟s performance where higher conflicts for data or long running transactions occur. Restarting from scratch also generates a negative response loop in the system, because the system suffers a
Style APA, Harvard, Vancouver, ISO itp.
19

Alzahrani, Fawaz, Mohd Yazid Idris, Mohd Fo’ad Rohani, and Rahmat Budiarto. "Hyperledger Fabric Graph Isomorphism Network for Conflict Transactions Detection in Multi-Version Concurrency Control." IEEE Access, 2025, 1. https://doi.org/10.1109/access.2025.3589165.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!

Do bibliografii