A partially persistent data structure for the set-union problem with backtracking

2005 ◽  
pp. 128-135
Author(s):  
Carlo Gaibisso
Keyword(s):  
Data Structure ◽  
Persistent Data

A new method for functional arrays

1997 ◽  
Vol 7 (5) ◽  
pp. 487-513 ◽  
Author(s):  
MELISSA E. O'NEILL ◽  
F. WARREN BURTON
Keyword(s):  
Data Structure ◽  
Programming Languages ◽  
Data Structures ◽  
Experimental Results ◽  
New Method ◽  
Functional Languages ◽  
Persistent Data ◽  
Performance Problems

Arrays are probably the most widely used data structure in imperative programming languages, yet functional languages typically only support arrays in a limited manner, or prohibit them entirely. This is not too surprising, since most other mutable data structures, such as trees, have elegant immutable analogues in the functional world, whereas arrays do not. Previous attempts at addressing the problem have suffered from one of three weaknesses, either that they don't support arrays as a persistent data structure (unlike the functional analogues of other imperative data structures), or that the range of operations is too restrictive to support some common array algorithms efficiently, or that they have performance problems. Our technique provides arrays as a true functional analogue of imperative arrays with the properties that functional programmers have come to expect from their data structures. To efficiently support array algorithms from the imperative world, we provide O(1) operations for single-threaded array use. Fully persistent array use can also be provided at O(1) amortized cost, provided that the algorithm satisfies a simple requirement as to uniformity of access. For those algorithms which do not access the array uniformly or single-threadedly, array reads or updates take at most O(log n) amortized time, where n is the size of the array. Experimental results indicate that the overheads of our technique are acceptable in practice for many applications.

AN ABSTRACT, SHARED AND PERSISTENT DATA STRUCTURE FOR SUPPORTING DATABASE MANAGEMENT AND MULTILINGUAL NATURAL LANGUAGE PROCESSING

1993 ◽  
Vol 03 (03) ◽  
pp. 369-382 ◽  
Author(s):  
CUI ZHANG ◽  
RICHARD F. WALTERS
Keyword(s):  
Data Structure ◽  
Programming Languages ◽  
Language Processing ◽  
Database Management ◽  
English Language ◽  
Database Systems ◽  
General Purpose ◽  
Programming Environment ◽  
Persistent Data ◽  
High Level

Neither today’s general purpose programming environment nor high-level programming languages, including those designed for AI purposes, provide adequate support for database systems. Furthermore, non-English language databases are difficult to treat either in existing database systems or with current high-level languages, because they require culture-sensitive operations on multiple foreign character sets. In this paper, we present an abstract, shared and persistent data structure, called HL+, capable of supporting database management applications. We also describe the means for coping with the aforementioned problems by accessing HL+ features of database management from high-level programming languages with an extensible programmable high-level language interface. Extensions to the data structure to accommodate processing of multiple foreign character strings are also described, and examples of multilingual applications are given.

A Persistent Data Structure for Managing Digital Identity Data Implemented on the Blockchain

2021 ◽  
Author(s):  
Lei Zeng ◽  
Weiwei Qiu ◽  
Xiaoyi Wang ◽  
Hongkai Wang ◽  
Yiyang Yao ◽  
...  
Keyword(s):  
Data Structure ◽  
Digital Identity ◽  
Persistent Data

scholarly journals A partially persistent data structure for the set-union problem

1990 ◽  
Vol 24 (2) ◽  
pp. 189-202 ◽  
Author(s):  
C. Gaibisso ◽  
G. Gambosi ◽  
M. Talamo
Keyword(s):  
Data Structure ◽  
Persistent Data

Distributed Modeling Of Building Systems Through Cyber-Physical Integration

2019 ◽  
pp. 12-17
Keyword(s):  
Data Structure ◽  
Operating Conditions ◽  
Physical Models ◽  
Distributed Model ◽  
Physical Processes ◽  
Distributed Modeling ◽  
Distributed Models ◽  
Operating Modes ◽  
Building Systems ◽  
Important Practical Application

This article describes the proposed approaches to creating distributed models that can, with given accuracy under given restrictions, replace classical physical models for construction objects. The ability to implement the proposed approaches is a consequence of the cyber-physical integration of building systems. The principles of forming the data structure of designed objects and distributed models, which make it possible to uniquely identify the elements and increase the level of detail of such a model, are presented. The data structure diagram of distributed modeling includes, among other things, the level of formation and transmission of signals about physical processes inside cyber-physical building systems. An enlarged algorithm for creating the structure of the distributed model which describes the process of developing a data structure, formalizing requirements for the parameters of a design object and its operating modes (including normal operating conditions and extreme conditions, including natural disasters) and selecting objects for a complete group that provides distributed modeling is presented. The article formulates the main approaches to the implementation of an important practical application of the cyber-physical integration of building systems - the possibility of forming distributed physical models of designed construction objects and the directions of further research are outlined.

Sign in / Sign up

Export Citation Format

Share Document