Results 11 to 20 of about 6,963,647 (337)
ACM Transactions on Programming Languages and Systems, 1981 Text is not the only data that needs editing. For example, interactive debuggers edit data structures internal to running programs. This paper describes eds, a generalized editor that allows users to edit arbitrary data structures. Examples show eds maintaining simple databases, editing LISP S-expressions, debugging SNOBOL4 programs, and creating and ...
Fraser, Christopher W., Lopez, A. A.
openaire +2 more sources
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
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
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
Does the Shannon bound really apply to all data structures?; pp. 47–58 [PDF]
Proceedings of the Estonian Academy of Sciences, 2013 Shannonâs information-theoretic lower bound has been developed for uniquely decodable systems of bit strings, while ordinary data structures often consist of many separate blocks of memory. One might expect that adapting the bound to data structures is
Antti Valmari
doaj +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
Structured data structures [PDF]
Communications of the ACM, 1974 Programming systems which permit arbitrary linked list structures enable the user to create complicated structures without sufficient protection. Deletions can result in unreachable data elements, and there is no guarantee that additions will be performed properly.
Shneiderman, Ben, Scheuermann, Peter
openaire +2 more sources
Data Structures for Mobile Data [PDF]
Journal of Algorithms, 1999 The authors present a set of novel data structures for the efficient maintenance of various continuous and discrete attributes of mobile data. A Kinetic Data Structure (KDS) maintains an attribute of interest in a system of geometric objects undergoing continuous motion.
Basch, Julien +2 more
openaire +2 more sources
Composite repetition-aware data structures [PDF]
, 2015 In highly repetitive strings, like collections of genomes from the same species, distinct measures of repetition all grow sublinearly in the length of the text, and indexes targeted to such strings typically depend only on one of these measures.
A Blumer +16 more
core +2 more sources