Focusing on the development of electronic-mart (e-mart) based on object-oriented databases (OODB), the concepts of integrated electronic-commerce (e-commerce) environment and e-mart are introduced, and the basic chara...Focusing on the development of electronic-mart (e-mart) based on object-oriented databases (OODB), the concepts of integrated electronic-commerce (e-commerce) environment and e-mart are introduced, and the basic characteristics of OODB Jasmine are described. In addition, the database mode and hierarchy of e-mart are discussed in detail.展开更多
This paper introduces a multi-granularity locking model (MGL) for concurrency control in object-oriented database system briefiy, and presents a MGL model formally. Four lockingscheduling algorithms for MGL are propos...This paper introduces a multi-granularity locking model (MGL) for concurrency control in object-oriented database system briefiy, and presents a MGL model formally. Four lockingscheduling algorithms for MGL are proposed in the paper. The ideas of single queue scheduling(SQS) and dual queue scheduling (DQS) are proposed and the algorithm and the performance evaluation for these two scheduling are presented in some paper. This paper describes a new idea of thescheduling for MGL, compatible requests first (CRF). Combining the new idea with SQS and DQS,we propose two new scheduling algorithms called CRFS and CRFD. After describing the simulationmodel, this paper illustrates the comparisons of the performance among these four algorithms. Asshown in the experiments, DQS has better performance than SQS, CRFD is better than DQS, CRFSperforms better than SQS, and CRFS is the best one of these four scheduling algorithms.展开更多
We introduce a model to implement incremental update of views. The principle is that unless a view is accessed, the modification related to the view is not computed. This modification information is used only when vie...We introduce a model to implement incremental update of views. The principle is that unless a view is accessed, the modification related to the view is not computed. This modification information is used only when views are updated. Modification information is embodied in the classes (including inheritance classes and nesting classes) that derive the view. We establish a modify list consisted of tuples (one tuple for each view which is related to the class) to implement view update. A method is used to keep views from re-update. Key words object-oriented database - incremental computation - view-computation - engineering information system CLC number TP 391 Foundation item: Supported by the National Natural Science Foundation of China(60235025)Biography: Guo Hai-ying (1971-), female, Ph. D, research direction: CAD and engineering information system.展开更多
Modeling plays an important role for the solution of the complex research problems. When the database became large and complex then it is necessary to create a unified model for getting the desired information in the ...Modeling plays an important role for the solution of the complex research problems. When the database became large and complex then it is necessary to create a unified model for getting the desired information in the minimum time and to implement the model in a better way. The present paper deals with the modeling for searching of the desired information from a large database by storing the data inside the three dimensional data cubes. A sample case study is considered as a real data related to the ground water and municipal water supply, which contains the data from the various localities of a city. For the demonstration purpose, a sample size is taken as nine but when it becomes very large for number of localities of different cities then it is necessary to store the data inside data cubes. A well known object-oriented Unified Modeling Language (UML) is used to create Unified class and state models. For verification purpose, sample queries are also performed and corresponding results are depicted.展开更多
OLDTNF resolution is an important mechanism used in a Prolog interpreter. This mechanism is extended and improved for evaluating recursive queries in deductive databases. The key idea of the refinement is to distingui...OLDTNF resolution is an important mechanism used in a Prolog interpreter. This mechanism is extended and improved for evaluating recursive queries in deductive databases. The key idea of the refinement is to distinguish between two classes of lookup nodes in an OLDTNF derivation and to handle them differently. First, reduce the search space by cutting of any subtree rooted at a lookup node of the first class. Further, speed up the evaluation by processing the second class in a second phase and generate many solutions directly from the solutions already produced (and the corresponding keys of solution lists) instead of evaluating them by expanding the corresponding subtrees in terms of the new solutions stored in solution lists.展开更多
A systematic, efficient compilation method for query evaluation of DeductiveDatabases (DeDB) is proposed in this paper. In order to eliminate redundancyand to minimize the potentially relevant facts, which are two key...A systematic, efficient compilation method for query evaluation of DeductiveDatabases (DeDB) is proposed in this paper. In order to eliminate redundancyand to minimize the potentially relevant facts, which are two key issues to theefficiency of a DeDB, the compilation process is decomposed into two phases.The first is the pre-compilation phase, which is responsible for the minimiza-tion of the potentially relevant facts. The second, which we refer to as thegeneral compilation phase, is responsible for the elimination of redundancy.The rule/goal graph devised by J. D. Ullman is appropriately extended andused as a uniform formalism. Two general algorithms corresponding to the twophases respectively are described intuitively and formally展开更多
This paper presents a practical concurrency control mechanism - ObjectLockingin OODBMS. Object-Locking can schedule transactions, each of themcan be considered as a sequence of high level operations defined on classe...This paper presents a practical concurrency control mechanism - ObjectLockingin OODBMS. Object-Locking can schedule transactions, each of themcan be considered as a sequence of high level operations defined on classes. Bythe properties of parallelity and coatativity between high level operations,proper lock modes for each operation are desigued and the compatibility matrixis constructed. With these lock modes, phatoms are kept away from databasesand a high degree of concurrency is achieved.展开更多
A deductive database approach for complex objects reasoning is proposed,which is characterized by handling predicates nesting in terms of mapping hierarchically structured rules and facts to a flattened Horn-clause im...A deductive database approach for complex objects reasoning is proposed,which is characterized by handling predicates nesting in terms of mapping hierarchically structured rules and facts to a flattened Horn-clause implementation scheme.展开更多
The data model of WHYMX complicates transaction management. Traditional locking method is not powerful enough to solve the new problem of concurrency control of WHYMX's transaction. This paper presents a number of...The data model of WHYMX complicates transaction management. Traditional locking method is not powerful enough to solve the new problem of concurrency control of WHYMX's transaction. This paper presents a number of concurrency control algorithms based on the extended locking method.展开更多
文摘Focusing on the development of electronic-mart (e-mart) based on object-oriented databases (OODB), the concepts of integrated electronic-commerce (e-commerce) environment and e-mart are introduced, and the basic characteristics of OODB Jasmine are described. In addition, the database mode and hierarchy of e-mart are discussed in detail.
文摘This paper introduces a multi-granularity locking model (MGL) for concurrency control in object-oriented database system briefiy, and presents a MGL model formally. Four lockingscheduling algorithms for MGL are proposed in the paper. The ideas of single queue scheduling(SQS) and dual queue scheduling (DQS) are proposed and the algorithm and the performance evaluation for these two scheduling are presented in some paper. This paper describes a new idea of thescheduling for MGL, compatible requests first (CRF). Combining the new idea with SQS and DQS,we propose two new scheduling algorithms called CRFS and CRFD. After describing the simulationmodel, this paper illustrates the comparisons of the performance among these four algorithms. Asshown in the experiments, DQS has better performance than SQS, CRFD is better than DQS, CRFSperforms better than SQS, and CRFS is the best one of these four scheduling algorithms.
文摘We introduce a model to implement incremental update of views. The principle is that unless a view is accessed, the modification related to the view is not computed. This modification information is used only when views are updated. Modification information is embodied in the classes (including inheritance classes and nesting classes) that derive the view. We establish a modify list consisted of tuples (one tuple for each view which is related to the class) to implement view update. A method is used to keep views from re-update. Key words object-oriented database - incremental computation - view-computation - engineering information system CLC number TP 391 Foundation item: Supported by the National Natural Science Foundation of China(60235025)Biography: Guo Hai-ying (1971-), female, Ph. D, research direction: CAD and engineering information system.
文摘Modeling plays an important role for the solution of the complex research problems. When the database became large and complex then it is necessary to create a unified model for getting the desired information in the minimum time and to implement the model in a better way. The present paper deals with the modeling for searching of the desired information from a large database by storing the data inside the three dimensional data cubes. A sample case study is considered as a real data related to the ground water and municipal water supply, which contains the data from the various localities of a city. For the demonstration purpose, a sample size is taken as nine but when it becomes very large for number of localities of different cities then it is necessary to store the data inside data cubes. A well known object-oriented Unified Modeling Language (UML) is used to create Unified class and state models. For verification purpose, sample queries are also performed and corresponding results are depicted.
文摘OLDTNF resolution is an important mechanism used in a Prolog interpreter. This mechanism is extended and improved for evaluating recursive queries in deductive databases. The key idea of the refinement is to distinguish between two classes of lookup nodes in an OLDTNF derivation and to handle them differently. First, reduce the search space by cutting of any subtree rooted at a lookup node of the first class. Further, speed up the evaluation by processing the second class in a second phase and generate many solutions directly from the solutions already produced (and the corresponding keys of solution lists) instead of evaluating them by expanding the corresponding subtrees in terms of the new solutions stored in solution lists.
文摘A systematic, efficient compilation method for query evaluation of DeductiveDatabases (DeDB) is proposed in this paper. In order to eliminate redundancyand to minimize the potentially relevant facts, which are two key issues to theefficiency of a DeDB, the compilation process is decomposed into two phases.The first is the pre-compilation phase, which is responsible for the minimiza-tion of the potentially relevant facts. The second, which we refer to as thegeneral compilation phase, is responsible for the elimination of redundancy.The rule/goal graph devised by J. D. Ullman is appropriately extended andused as a uniform formalism. Two general algorithms corresponding to the twophases respectively are described intuitively and formally
文摘This paper presents a practical concurrency control mechanism - ObjectLockingin OODBMS. Object-Locking can schedule transactions, each of themcan be considered as a sequence of high level operations defined on classes. Bythe properties of parallelity and coatativity between high level operations,proper lock modes for each operation are desigued and the compatibility matrixis constructed. With these lock modes, phatoms are kept away from databasesand a high degree of concurrency is achieved.
文摘A deductive database approach for complex objects reasoning is proposed,which is characterized by handling predicates nesting in terms of mapping hierarchically structured rules and facts to a flattened Horn-clause implementation scheme.
基金This research is supported by National Natural Science Foundation of China
文摘The data model of WHYMX complicates transaction management. Traditional locking method is not powerful enough to solve the new problem of concurrency control of WHYMX's transaction. This paper presents a number of concurrency control algorithms based on the extended locking method.
