Results 11 to 20 of about 37,551,526 (314)
Pronto: Easy and Fast Persistence for Volatile Data Structures
International Conference on Architectural Support for Programming Languages and Operating Systems, 2020 Non-Volatile Main Memories (NVMMs) promise an opportunity for fast, persistent data structures. However, building these data structures is hard because their data must be consistent in the wake of a failure.
Amirsaman Memaripour +2 more
semanticscholar +1 more source
THE USE OF DYNAMIC DATA PROCESSING STRUCTURES ON THE EXAMPLE OF LIST TRANSFORMATION TASKS
Современная наука и инновации, 2022 Introduction Information processing is a key operation with information. In this regard, the study mainstreams the issue of choosing the structural organisation of data for the purposes of organising the processing operation.
D. V. Zdor
doaj +1 more source
Optimal Joins Using Compact Data Structures [PDF]
, 2020 Worst-case optimal join algorithms have gained a lot of attention in the database literature. We now count with several algorithms that are optimal in the worst case, and many of them have been implemented and validated in practice.
Navarro, Gonzalo +2 more
core +2 more sources
A New Approach to Parallel Processing
IEEE Access, 2020 The Application Space Architecture (ASA) defines parallel processor design as an adjunct to the Instruction Set Architectures (ISA) defined by Von Neumann for single processors.
William C. Cave +5 more
doaj +1 more source
A Scalable Data Structure for Efficient Graph Analytics and In-Place Mutations
Data, 2023 The graph model enables a broad range of analyses; thus, graph processing (GP) is an invaluable tool in data analytics. At the heart of every GP system lies a concurrent graph data structure that stores the graph. Such a data structure needs to be highly
Soukaina Firmli, Dalila Chiadmi
doaj +1 more source
Lower Bounds for Oblivious Data Structures [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2018 An oblivious data structure is a data structure where the memory access patterns reveals no information about the operations performed on it. Such data structures were introduced by Wang et al.
R. Jacob +2 more
semanticscholar +1 more source
QuaSiMo: A composable library to program hybrid workflows for quantum simulation
IET Quantum Communication, 2021 A composable design scheme is presented for the development of hybrid quantum/classical algorithms and workflows for applications of quantum simulation.
Thien Nguyen +9 more
doaj +1 more source
Query Processing in Blockchain Systems: Current State and Future Challenges
Future Internet, 2021 When, in 2008, Satoshi Nakamoto envisioned the first distributed database management system that relied on cryptographically secured chain of blocks to store data in an immutable and tamper-resistant manner, his primary use case was the introduction of a
Dennis Przytarski +3 more
doaj +1 more source
Data Structures for Statistical Computing in Python
SciPy, 2010 In this paper we are concerned with the practical issues of working with data sets common to finance, statistics, and other related fields. pandas is a new library which aims to facilitate working with these data sets and to provide a set of fundamental ...
Wes McKinney
semanticscholar +1 more source
Energies, 2021 The increase of distributed energy resources (DERs) in low voltage (LV) distribution networks requires the ability to perform an accurate power flow analysis (PFA) in unbalanced systems.
Stefanos Petridis +5 more
doaj +1 more source