检索结果-内蒙古大学图书馆

object-oriented databases AND FRAME-BASED SYSTEMS - COMPARISON

INFORMATION AND SOFTWARE TECHNOLOGY 1991年第5期33卷 357-365页

作者： PATON, NW DIAZ, O UNIV ABERDEEN DEPT COMP SCI ABERDEEN AB9 1FX SCOTLAND UNIV BASQUE COUNTRY FAC INFORMAT BILBAO SPAIN

Research into knowledge representation within the artificial intelligence (AI) community has led to the development of AI tools that use frames to structure knowledge. Concurrent research in databases has led to the development of semantic data models and object-oriented databases. These two types of system seem to have much in common - they are structurally object-oriented, support inheritance, and store programs with the objects to which they relate. What then are the differences between frame systems and object-oriented databases? The paper compares a frame system called CRL with an object-oriented database called ADAM to identify common ground and differences between the systems and the philosophies underlying them. What emerges from the comparison is that while the systems have many superficial similarities, the different rationales that led to their development have resulted in significant practical differences in certain fundamental constructs.

关键词： object-oriented object-oriented databases FRAME-BASED SYSTEMS ARTIFICIAL INTELLIGENCE DATA MODELING

来源：评论

学校读者我要写书评

暂无评论

object-oriented databases for new applications

引用

Future Generation Computer Systems 1992年第2-3期7卷 317-327页

作者： Kim, Won Scheevel, Mark Tomlinson, Chris UniSQL Austin TX 78759 9390 Research Blvd Kaleido Bldg. No. 2 Suite 220 United States Microelectronics and Computer Technology Consortium Austin TX 78759 3500 West Balcones Center Drive United States

As applications have grown more sophisticated, they have placed greater demands on underlying database technology. In this paper we examine some of the shortcomings of conventional database technologies in the face of these demands, and then discuss how emerging object-oriented database technology addresses these shortcomings in several specific application areas: user interface applications, multimedia databases, CAD databases, statistical and scientific databases, and management of heterogeneous database systems. We conclude with a list of remaining challenges and some suggestions for further research. © 1992.

关键词： computer-aided engineering and design inheritance object-oriented object-oriented databases statistical databases

来源：评论

学校读者我要写书评

暂无评论

object-oriented databases 13th

Object-oriented databases

引用

13th European Conference on object-oriented Programming (ECOOP 99)

作者： Guerrini, G Merlo, I Ferrari, E Kappel, G de Miguel, A Univ Genoa DISI Genoa Italy Univ Milan DSI I-20122 Milan Italy Johannes Kepler Univ Linz A-4040 Linz Austria Univ Carlos III Madrid E-28903 Getafe Spain

ISBN: (纸本)354066954X

The goal of the First ECOOP Workshop on object-oriented databases was to bring together researchers working in the field of object-oriented databases, to discuss the work which is going on. The aim of the workshop was twofold: to discuss the current status of research in the field and to critically evaluate object-oriented database systems in terms of their current usage, of their successes and limitations, and their potential for new applications. The workshop thus consisted of a number of presentations of reviewed papers and of discussions on the topics mentioned above.

关键词： object-oriented databases

来源：评论

学校读者我要写书评

暂无评论

OPERATIONS AND QUERIES IN object-oriented databases SUPPORTING COMPLEX objectS

引用

INFORMATION AND SOFTWARE TECHNOLOGY 1993年第1期35卷 54-62页

作者： BHALLA, N BALASUNDARAM, S JAWAHARLAL NEHRU UNIV SCH COMP & SYST SCINEW MEHRAULI RDNEW DELHI 110067INDIA NCMRWF SUPER COMP CTR DEPT SCI & TECHNOLNEW DELHI 110003INDIA

In the paper, the authors attempt to extend the query model of ORION. The extension is based on adding two new features. First, is to extend relational algebra operations and set-theoretic operations to the world of classes. Second, to allow new classes to be created as a result of applying these operations on classes along the lines of relational databases. The extended query model allows a query against multiple target classes, i.e., a query that corresponds to relational join and set operations. It also enables the authors to retrieve complex objects and extracts attributes from component-type hierarchy equivalent to relational select and project operations respectively.

关键词： COMPLEX objectS COMPONENT-TYPE HIERARCHY COMPONENT-CLASS HIERARCHY object-oriented databases OPERATIONS ON COMPONENT-CLASS HIERARCHY QUERY PROCESSING

来源：评论

学校读者我要写书评

暂无评论

Processing temporal queries in the context of object-oriented databases

引用

INFORMATION AND SOFTWARE TECHNOLOGY 1999年第5期41卷 283-295页

作者： Wang, L Wing, M Davis, C Revell, N Univ London Univ Coll Dept Comp Sci London WC1E 6BT England Middlesex Univ Sch Comp Sci London N11 2NQ England

This article investigates an extensible approach to processing temporal queries in the context of object-oriented databases. Within the uniform query processing framework, a strategy of decomposition is proposed for processing temporal queries that involve paths based on the defined temporal object data model and query algebra. Algorithms for processing the decomposed query components have been implemented using stream processing techniques and are presented with cost analyses. Heuristics that optimize the temporal queries are also presented. Both cost analysis and simulations show that join time cost is linearly increased with the expansion in the number of time-epochs and that utilising the heuristics presented in this article can lead to a significant time cost saving. (C) 1999 Elsevier Science B.V. All rights reserved.

关键词： object-oriented databases temporal data query processing

来源：评论

学校读者我要写书评

暂无评论

Generalization-based data mining in object-oriented databases using an object cube model

引用

DATA & KNOWLEDGE ENGINEERING 1998年第1-2期25卷 55-97页

作者： Han, J Nishio, S Kawano, H Wang, W Simon Fraser Univ Sch Comp Sci Burnaby BC V5A 1S6 Canada Osaka Univ Dept Informat Syst Engn Osaka 5650871 Japan Kyoto Univ Dept Appl Syst Sci Kyoto 606850101 Japan

Data mining is the discovery of knowledge and useful information from the large amounts of data stored in databases. With the increasing popularity of object-oriented database systems in advanced database applications, it is important to study the data mining methods for object-oriented databases because mining knowledge from such databases may improve understanding, organization, and utilization of the data stored there. In this paper, issues on generalization-based data mining in object-oriented databases are investigated in three aspects: (1) generalization of complex objects, (2) class-based generalization, and (3) extraction of different kinds of rules. An object cube model is proposed for class-based generalization, on-line analytical processing, and data mining. The study shows that (i) a set of sophisticated generalization operators can be constructed for generalization of complex data objects, (ii) a dimension-based class generalization mechanism can be developed for object cube construction, and (iii) sophisticated rule formation methods can be developed for extraction of different kinds of knowledge from data, including characteristic rules, discriminant rules, association rules, and classification rules. Furthermore, the application of such discovered knowledge may substantially enhance the power and flexibility of browsing databases, organizing databases and querying data and knowledge in object-oriented databases.

关键词： data mining knowledge discovery in databases object-oriented databases object cube model

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of parallel query processing algorithms for object-oriented databases

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2000年第6期12卷 979-997页

作者： Su, SYW Ranka, S He, X Univ Florida Dept Comp & Informat Sci & Engn Database Syst & Dev Ctr Gainesville FL 32611 USA Microsoft Corp Kirkland MA USA

In recent years, parallel processing and optimization algorithms for processing object-oriented databases have drawn a considerable amount of attention from the database research community. Two general types of algorithms have been introduced: hybrid-hash pointer-based algorithms and multiwavefront algorithms. In this work, we quantitatively analyze the two algorithms and develop analytical formulas to capture the main performance features of these two approaches. We study their performance in three application environments: One is characterized by large databases having many object classes, each of which contains a large number of instances;the second one is characterized by large databases having many object classes, each of which contains a relatively small number of instances;and the third one is by large databases having object classes of varying sizes. A horizontal data partitioning strategy, in which each object class is partitioned into horizontal segments stored across all processors, is used in the first environment. A class-per-node assignment strategy, in which instances of each object class are stored in a single processor, is used in the second environment. In the third environment, object classes are partitioned horizontally and assigned to a varying number of processors depending on their different sizes. Our analytical results show that the multiwavefront algorithm has three distinguishing features which contribute to its better performance: 1) two-phase processing strategy, 2) vertical partitioning of horizontal segments, and 3) dynamic determination of "collision point" in multiwavefront propagations which results in an optimized query execution plan. We show that if these features are adopted by a hybrid-hash, pointer-based algorithm, its performance will be comparable with that of the multiwavefront algorithm because the difference in CPU time between them is negligible. The assumed computing environment is a network of workstations having a sha

关键词： object-oriented databases parallel query processing algorithms performance analysis data partitioning strategies database benchmark

来源：评论

学校读者我要写书评

暂无评论

A logical foundation for deductive object-oriented databases

引用

ACM TRANSACTIONS ON DATABASE SYSTEMS 2002年第1期27卷 117-151页

作者： Liu, MC Dobbie, G Ling, TW Carleton Univ Sch Comp Sci Ottawa ON K1S 5B6 Canada Univ Auckland Auckland 1020 New Zealand Natl Univ Singapore Singapore 117543 Singapore

Over the past decade, a large number of deductive object-oriented database languages have been proposed. The earliest of these languages had few object-oriented features, and more and more features have systematically been incorporated in successive languages. However, a language with a clean logical semantics that naturally accounts for all the key object-oriented features, is still missing from the literature. This article takes us another step towards solving this problem. Two features that are currently missing are the encapsulation of rule-based methods in classes, and nonmonotonic structural and behavioral inheritance with overriding, conflict resolution and blocking. This article introduces the syntax of a language with these features. The language is restricted in the sense that we have omitted other object-oriented and deductive features that are now well understood, in order to make our contribution clearer. It then defines a class of databases, called well-defined databases, that have an intuitive meaning and develops a direct logical semantics for this class of databases. The semantics is based on the well-founded semantics from logic programming. The work presented in this article establishes a firm logical foundation for deductive object-oriented databases.

关键词： languages theory declarative semantics deductive databases nonmonotonic multiple inheritance object-oriented databases rule-based languages

来源：评论

学校读者我要写书评

暂无评论

A tunable class hierarchy index for object-oriented databases using a multidimensional index structure

引用

INFORMATION AND SOFTWARE TECHNOLOGY 2001年第5期43卷 309-323页

作者： Lee, JH Whang, KY Han, WS Cho, WS Song, IY Catholic Univ Taegu Dept Comp Engn Taegu South Korea Chungbuk Natl Univ Management Informat Dept Seoul South Korea Drexel Univ Coll Informat Sci & Technol Philadelphia PA 19104 USA

This paper presents a tunable two-dimensional class hierarchy indexing technique (2D-CHI) for object-oriented databases. We use a two-dimensional file organization as the index structure. 2D-CHI deals with the problem of clustering objects in a two-dimensional domain space consisting of the key attribute domain and the class identifier domain. In conventional class indexing techniques using one-dimensional index structures such as the B+-tree, the clustering property is owned exclusively by one attribute. These indexing techniques do not handle the queries that address both the attribute keys and the class identifiers efficiently. 2D-CHI enhances query performance by adjusting the degree of clustering between the key value domain and the class identifier domain based on the precollected usage pattern. For performance evaluation, we first compare 2D-CHI with the conventional class indexing techniques using an analytic cost model based on the assumption of uniform object distribution, and then, verify the cost model through experiments using the multilevel grid file as the two-dimensional index. We further perform experiments with nonuniform object distributions. The experiments show that our proposed method builds optimal class index structures in terms of the total number of page accesses for given the precollected usage pattern regardless of query types and object distributions. (C) 2001 Elsevier Science B.V. All rights reserved.

关键词： object-oriented databases class hierarchy multidimensional structures self-tunable database systems

来源：评论

学校读者我要写书评

暂无评论

A MODEL FOR EVALUATION AND ADMINISTRATION OF SECURITY IN object-oriented databases

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 1994年第2期6卷 275-292页

作者： FERNANDEZ, EB GUDES, E SONG, HY BEN GURION UNIV NEGEV BEER SHEVAISRAEL INFORMIX SOFTWARE INC MENLO PKCA

The integration of object-oriented programming concepts with databases is one of the most significant advances in the evolution of database systems. Many aspects of such a combination have been studied, but there are few models to provide security for this richly structured information. We develop here an authorization model for object-oriented databases. This model consists of a set of policies, a structure for authorization rules, and algorithms to evaluate access requests against the authorization rules. User access policies are based on the concept of inherited authorization applied along the class structure hierarchy. We propose also a set of administrative policies that allow the control of user access and its decentralization. Finally, we study the effect of class structuring changes on authorization.

关键词： AUTHORIZATION MODELS DATABASE SECURITY object-oriented databases SECURITY ADMINISTRATION SECURITY OF object-oriented SYSTEMS

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：