SystemC Simulation Kernel, Data Types, Communication Primitives Concurrency Control, and Main Language Constructs

In order to generate efficient execution plans for queries comprising spatial data types and predicates, the database system has to be equipped with appropriate index structures, query processing methods and optimization rules. Although available extensible indexing frameworks provide a gateway for seamless integration of spatial access methods into the standard process of query optimization and execution, they do not facilitate the actual implementation of the spatial access method. An internal enhancement of the database kernel is usually not an option for database developers. The embedding of a custom, block-oriented index structure into concurrency control, recovery services and buffer management would cause extensive implementation efforts and maintenance cost, at the risk of weakening the reliability of the entire system. The server stability can be preserved by delegating index operations to an external process, but this approach induces severe performance bottlenecks due to context switches and inter-process communication. Therefore, we present the paradigm of object-relational spatial access methods that perfectly fits to the common relational data model, and is highly compatible with the extensible indexing frameworks of existing object-relational database systems, allowing the user to define application-specific access methods.

Download Full-text

Hybrid concurrency control for abstract data types

Journal of Computer and System Sciences ◽

10.1016/0022-0000(91)90031-y ◽

1991 ◽

Vol 43 (1) ◽

pp. 25-61 ◽

Cited By ~ 28

Author(s):

Maurice P. Herlihy ◽

William E. Weihl

Keyword(s):

Concurrency Control ◽

Abstract Data Types ◽

Data Types ◽

Abstract Data

Download Full-text

Designing a Software Transactional Memory for Peer-To-Peer Systems

Foundations of Computing and Decision Sciences ◽

10.2478/fcds-2013-0003 ◽

2013 ◽

Vol 38 (2) ◽

pp. 111-122

Author(s):

Aurel Paulovič ◽

Peter Lacko

Keyword(s):

Concurrency Control ◽

Transactional Memory ◽

Peer To Peer ◽

Successful Implementation ◽

Data Types ◽

Systems Research ◽

Novel Approach ◽

Peer To Peer Systems ◽

Cluster Environment ◽

Abstract Data

AbstractTransactional memory is a rather novel approach to concurrency control in parallel computing, that has just recently found its way into distributed systems research. However, the research concentrates mainly on single processor solutions or cluster environment. In this paper we argue, that peer-to-peer systems would require a different design of transactional memory because of the increased failure-rate of nodes, slower network and possibility of network splits. We also present a few of our design ideas, namely increased performance and fault tolerance through the use of higher-level conflict detection and resolution via abstract data types and eventually consistency, that as we think could be important to a successful implementation of a scalable and resilient transactional memory.

Download Full-text