object-oriented databases (OODBs) have been used for many advanced applications requiring advanced modeling power. In this paper, a locking-based concurrency control scheme is presented for OODBs. The proposed scheme ...
详细信息
ISBN:
(纸本)3540664858
object-oriented databases (OODBs) have been used for many advanced applications requiring advanced modeling power. In this paper, a locking-based concurrency control scheme is presented for OODBs. The proposed scheme reduces locking overhead for class hierarchy which is an important property in OODBs. While existing schemes show good performance only for specific applications, the proposed scheme can incur less locking overhead for any applications. For the performance evaluation of the proposed scheme, simulation is conducted using 007 benchmark. Through the simulation, the proposed scheme is compared with the two existing techniques. The performance studies show that the proposed scheme is superior to existing works.
In the area of highly interactive systems, the use of objectdatabases has significantly grown in the past few years due to the fact that one can, not only persistently store data in the form of objects, but also prov...
详细信息
ISBN:
(纸本)9783642146800
In the area of highly interactive systems, the use of objectdatabases has significantly grown in the past few years due to the fact that one can, not only persistently store data in the form of objects, but also provide additional functionality in terms of methods defined on these objects. However, a limitation of such a tight coupling of objects and their methods is that parts of the application logic cannot be reused without also having instances of these objects in the new application database. Based on our experience of designing multiple interactive cross-media applications, we propose an approach where we distinguish between regular database objects containing the data and so-called active components storing metadata about specific services. Active components are first class objects which, at activation time, can perform some operations on the server as well as on the client side. Since active components are standalone lightweight components, they can be dynamically bound to single objects or semantically grouped sets of objects and be automatically invoked by different forms of database interactions. The database-driven development of arbitrary client and server-side application functionality not only simplifies the design of highly interactive systems, but also improves the reuse of existing components across different systems.
In this paper, we summarize our experience in developing and using the Snowball Rapid Systems Engineering Tool. We highlight the techniques we used such as: Rapid Systems Engineering(TM) (RASE(TM)), Instant Code Gener...
详细信息
ISBN:
(纸本)0818684828
In this paper, we summarize our experience in developing and using the Snowball Rapid Systems Engineering Tool. We highlight the techniques we used such as: Rapid Systems Engineering(TM) (RASE(TM)), Instant Code Generation(TM), Instant Reverse Engineering(TM), and Dynamic Document Capture(TM). We elaborate on the implementation of these techniques and their advantages to systems development, problems rye encountered while developing Snowball, and we briefly discuss our experience while using Snowball to develop a large Internet-based object-oriented database system.
In objectoriented database languages and in languages supporting the semantic data model the construct used to collect sets of homogeneous entities is usually enriched with the possibility of imposing a set-inclusion...
详细信息
Integration is a central and variously used term in discussions about CASE. This paper has examined the following aspects of integration: tool integration above common data storage, tool integration via a common user ...
详细信息
This paper handles the conversion from an existing XML-Schema into object-oriented database. The major motivation for this work is to store XML-Schema into objectoriented database. There are more common features betw...
详细信息
ISBN:
(纸本)9781424426591
This paper handles the conversion from an existing XML-Schema into object-oriented database. The major motivation for this work is to store XML-Schema into objectoriented database. There are more common features between the object-oriented model and XML, and thus it is more attractive to map from XML into object-oriented database;such mapping preserves database specifics. To achieve the mapping, what we call the object graph is derived based on characteristics of the XML-Schema;it simply summarizes and includes all complex and simple elements and the links, which are the basics of the XML-Schema. Then, the links are simulated in terms of nesting to get a simulated object graph. This way, everything in a simulated object graph is directly representable in object-oriented database. Finally, we handle the mapping of the actual data from XML document(s) into the corresponding object-oriented database.
Several researchers have considered integrating multiple unstructured, semi-structured, and structured data sources by modeling all sources as edge labeled graphs. Data in this model is self-describing and dynamically...
详细信息
ISBN:
(纸本)3540648232
Several researchers have considered integrating multiple unstructured, semi-structured, and structured data sources by modeling all sources as edge labeled graphs. Data in this model is self-describing and dynamically typed, and captures both schema and data information. The labels are arbitrary atomic values, such as strings, integers, reals, etc., and the integrated data graph is stored in a unique data repository, as a relation of edges. The relation is dynamically typed, i.e. each edge label is tagged with its type. Although the unique, labeled graph repository is flexible, it looses all static type information, and results in severe efficiency penalties compared to querying structured databases, such as relational or object-oriented databases. III this paper we propose an alternative method of storing and querying semi-structured data, using storage schemas, which are closely related to recently introduced graph schemas [BDFS97]. A storage schema splits the graph's edges into several relations, some of which may have labels of known types (such as strings or integers) while others may be still dynamically typed. We show here that all positive queries in UnQL, a query language for semistructured data, can be translated into conjunctive queries against the relations in the storage scheme. This result may be surprising, because UnQL is a powerful language, featuring regular path expressions, restructuring queries, joins, and unions. We use this technique in order to translate queries on the integrated, semi-structured data into queries on the external sources. In this setting the integrated semi-structured data is not materialized but virtual and the problem is to translate a query against the integrated view, possibly involving regular path expressions and restructuring, into queries which can be answered by the external sources. Here we use again the storage schema in order to split the graph into relations according to their sources. Any positive UnQL query is
作者：
Coyle, Karen
(Karen Coyle is Digital Libraries Consultant Berkeley California USA)
The paper performs a thought experiment on the concept of a record based on the Functional Requirements for Bibliographic Records and library system functions, and concludes that if we want to develop a functional bib...
详细信息
This article is devoted to the problem of software developers' labor productivity, cost of information system ownership and to the developed environment of application programming OR3 to solve this problem. The pr...
详细信息
ISBN:
(纸本)9781479941209
This article is devoted to the problem of software developers' labor productivity, cost of information system ownership and to the developed environment of application programming OR3 to solve this problem. The problem of application of the third and fourth generation programming language in application development is discussed. A brief description of the development environment OR3 and the samples of its application is provided.
In this paper, object database schema design is addressed through the problem of designing the inheritance graph. We propose a method, called iO2, for building the inheritance graph of an O2 database schema. The iO2 m...
详细信息
ISBN:
(纸本)354061656X
In this paper, object database schema design is addressed through the problem of designing the inheritance graph. We propose a method, called iO2, for building the inheritance graph of an O2 database schema. The iO2 method is based on the Galois lattice data structure. It encompasses three steps: a (first) construction step, a (second) optimization step, and a (final) generation step. This paper focuses on the two latter steps. The optimization step builds the Galois inheritance graph from the Galois graph (delivered by the construction step) of the finite binary relation associating properties to entity and relationship types. We define a new optimization algorithm which eliminates redundancies from the Galois graph. The generation step yields the O2 inheritance graph from the Galois inheritance graph.
暂无评论