Search
Browse by Issue
Fig/Tab
Adv Search
HOME
ABOUT JCST
Scope
Editorial Board
Index Info
Events
Subscription
Contacts
AUTHORS
Online Submission
Guidelines for Authors
Download Templates
REVIEWERS
Guidelines for Reviewers
Online Peer Review
Acknowledgement
PUBLISHED PAPERS
Current Issue
Archive
Special Issues
Collection
Surveys
FORTHCOMING PAPERS
Just Accepted
Online First
Data Management and Data Mining
Under Construction
默认
最新文章
浏览次数
全选
合并摘要
导出引用
EndNote
Reference Manager
ProCite
BibTeX
RefWorks
显示图片
A Tree-Structured Database Machine for Large Relational Database Systems
孟力明; 徐晓飞; 常会友; 陈光熙; 胡铭曾; 李生;
1987,2(4 ):265 -275.
摘要
（
2611
）
PDF（pc）
（312KB）（
1211
）
收藏
This paper proposes a Tree-structured Database Machine (TDM), which is designed for supporting large relational database systems. The TDM aims at totally improving three level performance bottlenecks in relational database systems, i.e. data transfer bottleneck, data processing bottleneck, and multiquery optimization bottleneck. For reducing these bottlenecks, the TDM provides the approaches of data partition and data distribution upon data storages for concurrent data accesses, the tree-structured multipro…
参考文献
丨
相关文章
丨
多维度评价
Data Dependencies in Database with Incomplete Information
张焰; 何继潮;
1988,3(2 ):131 -138.
摘要
（
2541
）
PDF（pc）
（376KB）（
1150
）
收藏
To get more meaning of incomplete information,a predicate way is proposed to represent the nulls.The concepts of functional and multivalued dependencies are extended in the environment which allows nulls in a database relation.The inference rules which can be applied to the extended dependencies are investigated.Finally it is shown that the rules are complete for the family of extended functional and multivalued dependencies.
参考文献
丨
相关文章
丨
多维度评价
Transaction Management in Distributed Database System POREL
王翰虎;
1988,3(2 ):139 -146.
摘要
（
2781
）
PDF（pc）
（424KB）（
1461
）
收藏
This paper describes the architecture and implementation algorithm of a transaction management suhsystem (TM) in the distributed database system POREL.The TM has been reimplemented on VAX 11/750.
参考文献
丨
相关文章
丨
多维度评价
A Deductive Database Approach for Complex Objects
陈其明;
1990,5(3 ):225 -235.
摘要
（
2341
）
PDF（pc）
（505KB）（
1170
）
收藏
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.
参考文献
丨
相关文章
丨
多维度评价
An Efficient Algorithm for Processing Multi-Relation Queries in Relational Databases
刘惟一;
1990,5(3 ):236 -240.
摘要
（
2416
）
PDF（pc）
（230KB）（
1136
）
收藏
After a relation scheme R is decomposed into the set of schemes ρ={R_1,...,R_n},we may pose queries as if R existed in the database,taking a join of R_i s,when it is necessary to implement the query.Suppose a query involves a set of attributes S(?)R,we want to find the smallest subset of ρ whose union includes S.We prove that the problem is NP-complete and present a polynomial-bounded approximation algorithm.A subset of ρ whose union includes S and has a decomposition into 3NF with a lossless join and prese...
参考文献
丨
相关文章
丨
多维度评价
Design and Implementation of a Heterogeneous Distributed Database System
金志权; 柳诚飞; 孙钟秀; 周晓方; 陈佩佩; 顾建明;
1990,5(4 ):363 -373.
摘要
（
2924
）
PDF（pc）
（517KB）（
1438
）
收藏
This paper introduces a heterogeneous distributed database system called LSZ system, where LSZ is an abbreviation of Li Shizhen, an ancient Chinese medical scientist. LSZ system adopts cluster as distributed database node (or site). Each cluster consists of one or several microcomputers and one server. The paper describes its basic architecture and the prototype implementation, which includes query processing and optimization, transaction manager and data language translation. The system provides a uniform …
参考文献
丨
相关文章
丨
多维度评价
An Intelligent Tool to Support Requirements Analysis and Conceptual Design of Database Design
王能斌; 刘海青;
1991,6(2 ):153 -160.
摘要
（
2470
）
PDF（pc）
（239KB）（
1259
）
收藏
As an application of artificial intelligence and expert system technology to database design,this paper presents an intelligent design tool NITDT,which comprises a requirements specification lan- guage NITSL,a knowledge representation language NITKL,and an inference engine with uncertainty reasoning capability.NITDT now covers the requirements analysis and conceptual design of database design.However,it is possible to be integrated with another database design tool, NITDBA,developed also at NIT to become an…
参考文献
丨
相关文章
丨
多维度评价
A New Approach to Database Auto-Design by Logic
徐洁盘; 王磊;
1991,6(2 ):201 -204.
摘要
（
2528
）
PDF（pc）
（197KB）（
1351
）
收藏
The database auto-design is an important problem in database research.In this paper we propose some new ideas and an approach called“logic approach”to implement the database auto-design.Given a relational scheme and a set of the functional dependencies for the relation we can obtain all of the functional dependencies and key for the relation and determine the normal form the relation satisfies.
参考文献
丨
相关文章
丨
多维度评价
Form alizing Incomplete Knowledge in Incomplete Databases
沈一栋;
1992,7(4 ):295 -304.
摘要
（
2433
）
PDF（pc）
（279KB）（
1105
）
收藏
Up to now, no satisfactory theory has been established for formalizing incomplete knowledge in incomplete databases. In this paper, we clarify why existing closed world approaches, such as the CWA, the GCWA, the ECWA, circumscription, predicate completion and the PWA, fail to do so, and propose a new method. The method is an augmentation of both the ECWA and circumscrip- tion with the mechanism to discriminate implicitly expressed positive knowledge, negative knowledge and truly unknown knowledge.
参考文献
丨
相关文章
丨
多维度评价
An Algorithm for Determining Database Consistency Under the Closed World Assumption
沈一栋;
1992,7(4 ):289 -294.
摘要
（
2417
）
PDF（pc）
（270KB）（
1124
）
收藏
It is well-known that there are circumstances where applying Reiter s closed world assump- tion (CWA) will lead to logical inconsistencies . In this paper, a new characterization of the CWA consistency is pesented and an algorithm is proposed for determining whether a datalase with- out function symbols is consistent with the CWA. The algorithm is shown to be efficient.
参考文献
丨
相关文章
丨
多维度评价
Concurrency Control of Single-Level Transaction in WHYMX Object-Oriented Database System
徐庆云; 王能斌;
1992,7(4 ):311 -315.
摘要
（
2478
）
PDF（pc）
（134KB）（
1096
）
收藏
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.
参考文献
丨
相关文章
丨
多维度评价
A New Integrated System of Logic Programming and Relational Database
邓铁清; 吴泉源; 王志英;
1993,8(1 ):58 -67.
摘要
（
3223
）
PDF（pc）
（590KB）（
1304
）
收藏
Based on the study of the current two methods—interpretation and compilation—for the integration of logic programming and relational database,a new precompilation-based interpretive approach is proposed.It inherits the advantages of both methods,but overcomes the drawbacks of theirs.A new integrated system based on this approach is presented,which has been implemented on Micro VAX Ⅱ and applied to practise as the kernel of the GKBMS knowledge base management system.Also discussed are the key implementation …
参考文献
丨
相关文章
丨
多维度评价
A Fixpoint Semantics for Stratified Databases
沈一栋;
1993,8(2 ):12 -21.
摘要
（
2619
）
PDF（pc）
（557KB）（
1127
）
收藏
Przymusinski extended the notion of stratified logic programs,developed by Apt,Blair and Walker,and by van Gelder,to stratified databases that allow both negative premises and disjunctive consequents.However,he did not provide a fixpoint theory for such class of databases.On the other hand,although a fixpoint semantics has been developed by Minker and Rajasekar for non-Horn logic programs,it is tantamount to traditional minimal model semantics which is not sufficient to capture the intended meaning of negat…
参考文献
丨
相关文章
丨
多维度评价
On Local StratifiabUity of Logic Programs and Databases
沈一栋; 童頫; 程代杰;
1993,8(2 ):3 -11.
摘要
（
2885
）
PDF（pc）
（457KB）（
1355
）
收藏
In this paper,we deal with the problem of verifying local stratifiability of logic programs and databases presented by Przymusinski.Necessary and sufficient conditions for the local stratifiability of logic programs are presented and algorithms for performing the verification are developed.Finally,we prove that a database DB containing clauses with disjunctive consequents can be easily converted into a logic program P such that DB is locally stratified iff P is locally stratified.
参考文献
丨
相关文章
丨
多维度评价
A Distributed Algorithm for Determining Minimal Covers of Acyclic Database Schemes
叶新铭;
1994,9(3 ):204 -214.
摘要
（
3552
）
PDF（pc）
（469KB）（
1264
）
收藏
Acyclic databases possess several desirable properties for their design and use. Adistributed algorithm is proposed for determining a minimal cover of an alpha-, beta-,gamma-, or Berge-acyclic database scheme over a set of attributes in a distributedenvironment.
参考文献
丨
相关文章
丨
多维度评价
Towards Restructuring and Normalization of Types in Databases
杨立;
1995,10(1 ):65 -73.
摘要
（
3138
）
收藏
The equivalence- preserving transformation and normalization of types inobject-oriented databases are discussed. Specifically a normal form of typesbased on set-theoretic equivalence is proposed, rewrite rules which transformtypes into normal forms are presented, and the uniqueness of normal form andthe completeness of rewrite rules are proved. The emphasis of this work ison normal forms and corresponding rewrite rules. It provides a new formalapproach for the study of restructuring of database schema and o…
参考文献
丨
相关文章
丨
多维度评价
The Modelling of Temporal Data in the Relational Database Environment
孙远;
1995,10(2 ):163 -174.
摘要
（
3130
）
PDF（pc）
（498KB）（
1368
）
收藏
This research takes the view that the modelling of temporal data is a fundamental step towards the solution of capturing semantics of time. The problemsinhereat in the mod6iling of time are not unique to datahase processing. Therepresentation of temporal knowledge and temporal reasoning arises in a widerange of other disciplines. ln this paper an account is given of a techniquefor modelling the semantics of temporal data and its associated normalizationmcthod. It discusses the techniques of processing tempo…
参考文献
丨
相关文章
丨
多维度评价
Query Optimization for Deductive Databases
周傲英; 施伯乐;
1995,10(2 ):134 -148.
摘要
（
3153
）
PDF（pc）
（306KB）（
1957
）
收藏
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 e…
参考文献
丨
相关文章
丨
多维度评价
Object Identity in Database Systems
李天柱;
1995,10(4 ):380 -384.
摘要
（
3018
）
PDF（pc）
（208KB）（
1394
）
收藏
The concept of object identity and implementation of object identity in some sys-tems have been explained in literature. Based on an analysis on the idea of data schemein ANSI/X3/SPARC, this paper presents the concept of fulLidentity which includesentity identity conceptual object identity and internal object identity In addition, theequality of objects, which is richer and more practical, is discussed based on the fullidentity of objects. Therefore, the semanics and constructions of the identity for thecom…
参考文献
丨
相关文章
丨
多维度评价
Using Multivalued Logic in Relational Database Containing Null Value
马宗民; Yan Li;
1996,11(4 ):421 -426.
摘要
（
3233
）
PDF（pc）
（252KB）（
1516
）
收藏
In this paper, several kinds of multivalued logic for relational database and their developing process are presented on the basis of null value's semantics. A new 5 valued logic is led into relational database containing null talue. The feasibility and necessity of using 5 valued logic are expounded. Comparative calculation and logical calculation under 5 valued logic are defined at the end of the paper.
参考文献
丨
相关文章
丨
多维度评价
Design and Implementation of a Concurrency Control Mechanism in an Object-Oriented Database System
曲云尧; 田增平; 王宇君; 施伯乐;
1996,11(4 ):337 -246.
摘要
（
3065
）
PDF（pc）
（191KB）（
1314
）
收藏
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.
参考文献
丨
相关文章
丨
多维度评价
An Algorithm for Determining Minimal Reduced-Coverings of Acyclic Database Schemes
刘铁英; 叶新铭;
1996,11(4 ):347 -355.
摘要
（
2782
）
PDF（pc）
（382KB）（
1233
）
收藏
This paper reports an algorithm (DTV) for deterdring the minimal reducedcovering of an acyclic database scheme over a specified subset of attributes. The output of this algorithm contains not only minimum number of attributes but also minimum number of partial relation schemes. The algorithm has complexity O(|N|·|E|2), where |N| is the number of attributes and |E| the number of relation schemes- It is also proved that for Berge, γ orβ acyclic database schemes, the output of algorithm DTV maintains the acyc…
参考文献
丨
相关文章
丨
多维度评价
Normalization of Class Hierarchy in Databases
李天柱; 肖计田; 孙兆豪; 边小凡;
1996,11(4 ):356 -364.
摘要
（
3430
）
PDF（pc）
（201KB）（
1200
）
收藏
In complex object oriented databases, the purpose of introducing class hierarchy is to express ISA sematics, to realize inheriting and to reuse schema definition codes. The schema definition and schema evolution, based on the partial order of lattice, often cause the loss of information inheriting and the redundance of schema dedrition. Based on the fullness of the inheritance shownby class hierarchy three normal forms of class hierarchy are given in this paper, and a general algorithm of normalization of c…
参考文献
丨
相关文章
丨
多维度评价
A Logical Design Method for Relational Databases Based on Generalization and Aggregation Semantics
刘惟一; 姚弘;
1997,12(3 ):252 -262.
摘要
（
3353
）
PDF（pc）
（277KB）（
1294
）
收藏
In this paper, a series of design methods for relational databases based on generalization and aggregation sematics is set up. The relationship between a class and its subclass is considered as a scheme constraint. The concept of inheritance dependencies, which describes the multiple inheritance among schemes,is presented in the paper. It is shown that the inference rules for inheritance dependencies are sound and complete. Furthermore, a series of results about the closure of inheritance dependencies and the minimal set of inheritance dependencies, which are analogues to functional dependencies, is obtained. In order to describe the aggregation semalltics, the concept of aggregation dependencies is given. It is easy to implement these constraints under relational database management systems.
参考文献
丨
相关文章
丨
多维度评价
A Reasoning Mechanism for DeductiveObject-Oriented Databases
张成洪; 胡运发; 施伯乐;
1997,12(4 ):337 -345.
摘要
（
2929
）
PDF（pc）
（213KB）（
1249
）
收藏
Based on the approach implementing a deductive object-oriented database system through the underlying relational database, this paper presents an object reasoning language O-Datalog, which is the extension of Datalog in form and can deal with object-oriented data. For any O-Datalog program, an equivalent Datalog program can be built to help evaluate the original program. This paper focuses on the syntax, semantics and evaluation of O-Datalog
参考文献
丨
相关文章
丨
多维度评价
Extracting Schema from an OEM Database
沈一栋;
1998,13(4 ):289 -299.
摘要
（
3315
）
PDF（pc）
（482KB）（
1403
）
收藏
While the schema-less feature of the OEM (Object Exchange Model) gives fiexibility in representing semi-structured data, it brings difficulty in formulating database queries.Extracting schema from an OEM database then becomes an important research topic.This paper presents a new approach to this topic with the following features. (1) In addition to representing the nested label structure of an OEM database, the proposed OEM schema keeps upto-date information about instance objects of the database.The object…
参考文献
丨
相关文章
丨
多维度评价
An Overview of Data Mining and Knowledge Discovery
范建华; 李德毅;
1998,13(4 ):348 -368.
摘要
（
3904
）
PDF（pc）
（1824KB）（
1897
）
收藏
With massive amounts of data stored in databases, mining information and knowledge in databases has become an important issue in recent research. Researchers in many different fields have shown great interest in data mining and knowledge discovery in databases. Several emerging applications in information providing services, such as data warehousing and on-line services over the Internet, also call for various data mining and knowledge discovery techniques to understand user behavior better, to improve the …
参考文献
丨
相关文章
丨
多维度评价
View Creation for Queriesin Object Oriented Databases
Rajesh Narang; K.D. Sharma;
1999,14(4 ):349 -362.
摘要
（
2861
）
PDF（pc）
（613KB）（
1456
）
收藏
A view in object oriented databases corresponds to virtual schemawith restructured generalization and decomposition hierarchies. Numbers of viewcreation methodologies have been proposed. A major drawback of existing method-ologies is that they do not maintain the closure property. That is, the result of aquery does not have the same semantics as embodied in the object oriented datamodel. Therefore, this paper presents a view creation methodology that derives aclass in response to a user's query, integrates …
参考文献
丨
相关文章
丨
多维度评价
Incremental Mining of the Schema of Semistructured Data
周傲英; 金文; 周水庚; 钱卫宁; 田增平;
2000,15(3 ):241 -248.
摘要
（
3219
）
PDF（pc）
（349KB）（
1317
）
收藏
Semistructured data are specified in lack of any fixed and rigidschema, even though typically some implicit structure appears in the data. Thehuge amounts of on-line applications make it important and imperative to mine theschema of semistructured data, both for the users (e.g., to gather useful informationand facilitate querying) and for the systems (e.g., to optimize access). The criticalproblem is to discover the hidden structure in the semistructured data. Currentmethods in extracting Web data structure…
参考文献
丨
相关文章
丨
多维度评价
Design and Implementation of an Interoperable object Platform for Multi-Databases
顾宁; 许学标; 施伯乐;
2000,15(3 ):249 -260.
摘要
（
2914
）
PDF（pc）
（518KB）（
1305
）
收藏
In this paper, the authors present the design and implementation of an Interoperable Object Platform for Multi-Databases (IOPMD). The aim of the system is to provide a uniform object view and a set of tools for object manipu lation and query based on heterogeneous multiple data sources under client/server environment. The common object model is compatible with ODMG2.0 and OMG'sCORBA, which provides main OO features such as OID, attribute, method, inheri tance, reference, etc. Three types of interfaCes, name…
参考文献
丨
相关文章
丨
多维度评价
Fast Algorithms of Mining Probability Functional Dependency Rules in Relational Database
陶晓鹏; 周傲英; 胡运发;
2000,15(3 ):261 -270.
摘要
（
3553
）
PDF（pc）
（436KB）（
1507
）
收藏
This paper defines a new kind of rule, probability functional dependency rule. The functional dependency degree can be depicted by this kind of rule. Five algorithms, from the simple to the complex, are presefited to mine this kind of rule in different condition. The related theorems are proved to ensure the high efficiency and the correctness of the above algorithms.
参考文献
丨
相关文章
丨
多维度评价
Word Segmentation Based on Database Semanticsin NChiql
孟小峰; 刘爽; 王珊;
2000,15(4 ):346 -354.
摘要
（
3325
）
PDF（pc）
（402KB）（
1313
）
收藏
In this paper a novel word-segmentation algorithm is presented todelimit words in Chinese natural language queries in NChiql system, a Chinese natural language query interface to databases. Although there are sizable literatureson Chinese segmentation, they cannot satisfy particular requirements in this system. The novel word-segmentation algorithm is based on the database semantics,namely Semantic Conceptual Model (SCM) for specific domain knowledge. Basedon SCM, the segmenter labels the database semantics…
参考文献
丨
相关文章
丨
多维度评价
Word Segmentation Based on Database Semantics in Nchiql
MENG Xiaofeng（孟小峰），LIU Shuang（刘爽）and WANG Shan（王珊）
2000,15(4 ):0 -0.
摘要
（
2126
）
PDF（pc）
（323KB）（
1452
）
收藏
暂缺
相关文章
丨
多维度评价
Dynamic Interval Index Structure in Constraint Database Systems
汪卫; 王宇君; 施伯乐;
2000,15(6 ):542 -551.
摘要
（
2960
）
PDF（pc）
（207KB）（
1171
）
收藏
Interval index structure plays an important role in constraint database systems. A dynamic interval index structure DM-tree is presented in this paper. The advantage of the DM-tree compared with other interval index structures is that the dynamic operations of insertion and deletion can be operated on the new structure. The storage complexity of the tree is O(n), and the query I/O complexity is O(log n+t/B). To improve the performance of the inserting and deleting operations, some methods such as neighbor…
参考文献
丨
相关文章
丨
多维度评价
Approaches for Scaling DBSCAN Algorithm to Large Spatial Databases
周傲英; 周水庚; 曹晶; 范晔; 胡运发;
2000,15(6 ):509 -526.
摘要
（
4358
）
PDF（pc）
（801KB）（
1667
）
收藏
The huge amount of information stored in databases owned by corporations (e.g., retail, financial, telecom) has spurred a tremendous interest in the area of knowledge discovery and data mining. Clustering, in data mining, is a useful technique for discovering interesting data distributions and patterns in the underlying data, and has many application fields, such as statistical data analysis, pattern recognition, image processing, and other business applications. Although researchers have been working on …
参考文献
丨
相关文章
丨
多维度评价
POTENTIAL: A Highly Adaptive Core of Parallel Database System
文继荣; 陈红; 王珊;
2000,15(6 ):527 -541.
摘要
（
2963
）
PDF（pc）
（650KB）（
1232
）
收藏
POTENTIAL is a virtual database machine based on general computing platforms, especially parallel computing platforms. It provides a complete solution to high-performance database systems by a 'virtual processor + virtual data bus + virtual memory' architecture. Virtual processors manage all CPU resources in the system, on which various operations are running. Virtual data bus is responsible for the management of data transmission between associated operations, which forms the hinges of the entire system....
参考文献
丨
相关文章
丨
多维度评价
A Fast Algorithm for Mining Association Rules
黄刘生; 陈华平; 王洵; 陈国良;
2000,15(6 ):619 -624.
摘要
（
3879
）
PDF（pc）
（159KB）（
1229
）
收藏
In this paper, the problem of discovering association rules between items in a large database of sales transactions is discussed, and a novel algorithm, BitMatrix, is proposed. The proposed algorithm is fundamentally different from the known algorithms Apriori and AprioriTid. Empirical evaluation shows that the algorithm outperforms the known ones for large databases. Scale-up experiments show that the algorithm scales linearly with the number of transactions.
参考文献
丨
相关文章
丨
多维度评价
A Fast Algorithm for Mining Associstion Rules
HUANG Liusheng（黄刘生），CHEN Huaping（陈华平），WANG Xun（王洵）and CHEN Guoliang（陈国良）
2000,15(6 ):0 -0.
摘要
（
2001
）
PDF（pc）
（271KB）（
1618
）
收藏
暂缺
相关文章
丨
多维度评价
Approaches for Scaling DBSCAN Algorithm to Large Spatial Databases
ZHOU Aoying（周傲英），ZHOU Shuigeng（周水庚），GAO Jing（曹晶），FAN Ye（范晔）and HU Yunfa（胡运发）
2000,15(6 ):0 -0.
摘要
（
2015
）
PDF（pc）
（458KB）（
1471
）
收藏
暂缺
相关文章
丨
多维度评价
POTENTIAL:A Highly Adaptive Core of Parallel Database System
WEN Jirong（文继荣），CHEN Hong（陈红）and WANG Shan（王珊）
2000,15(6 ):0 -0.
摘要
（
1906
）
PDF（pc）
（407KB）（
1323
）
收藏
暂缺
相关文章
丨
多维度评价
«
‹
›
»
(291 Records )
版权所有 © 《计算机科学技术学报》编辑部
本系统由
北京玛格泰克科技发展有限公司设计开发
技术支持：support@magtech.com.cn
总访问量：
