WEIGHTED ALGORITHM FOR FINGERPRINTING RELATIONAL DATABASES

The necessity and the feasibility of introducing attribute weight into digital fingerprinting system are given. The weighted algorithm for fingerprinting relational databases of traitor tracing is proposed. Higher weights are assigned to more significant attributes, so important attributes are more frequently fingerprinted than other ones. Finally, the robustness of the proposed algorithm, such as performance against collusion attacks, is analyzed. Experimental results prove the superiority of the algorithm.

基于Relational Database的企业员工远程教学平台信息库建设的浅谈

文章对Relation database库结构进行分析,研究基于Relation database建设远程教学信息库的可行性,并以企业员工远程教学管理系统中信息库的构建为案例,说明Relation database库的优势。

A STUDY ON CELLULAR AUTOMATA BASED ON RELATIONAL DATABASES AND SPATIO-TE MPORAL SIMULATIONS OF CULTURE DIFFUSION

This paper presents a development o f the extended Cellular Automata9CA),based on relational databases(RDB),to model dynamic interactions amon g spatial objects.The integration o f Geographical Information System(GIS)and CA has the great advantage of simu lationg geographical processes.But standard CA has some restrictions i n cellular shape and neighbourhood and neighbour rules,which restrict the CA’ s ability to simulate complex,real world environ-ments.This paper discusses a cell’ s spatialrelationbasedonthe spatialobject’ s geometricalandmon -geometricalc haracter-istics,and extends the cell’ s neighbour definition,and considers that the cell’ s neighbour lies in the forms of not on ly spa-tial adjacency but also attribute co rrelation.This paper then puts forw ard that spatial relations between t wo different cells can be divided into three types,including spatial adjacency,neighbour hood and complicated separation.Ba sed on tradition-al ideas,it is impossible to settle CA’ s restrictions completely.RDB -based CA is an academic experiment,in which some fields ard desighed to describe the essential information needed to define and select a cell’ s neighbour.The culture innovation diffusion system has mul tiple forms of space diffusion and in herited characteristics that the RD B -based CA is capable of simulating more effectiv ely.Finally this paper details a successful case study on the diffusion o f fashion wear trends.Compared to the original CA,the RDB -based CA is a more natural and efficient representation of human k nowl-edge over space,and is an effective t ol in simulation complex systems that have multiple forms of spatial diff usion.

A Weighted Algorithm for Watermarking Relational Databases

A weighted algorithm for watermarking relational databases for copyright protection is presented. The possibility of watermarking an attribute is assigned according to its weight decided by the owner of the database. A one-way hash function and a secret key known only to the owner of the data are used to select tuples and bits to mark. By assigning high weight to significant attributes, the scheme ensures that important attributes take more chance to be marked than less important ones. Experimental results show that the proposed scheme is robust against various forms of attacks, and has perfect immunity to subset attack.

Rules-based object-relational databases ontology construction

To solve the problems of shaving and reusing information in the information system, a rules-based ontology constructing approach from object-relational databases is proposed. A 3-tuple ontology constructing model is proposed first. Then, four types of ontology constructing rules including class, property, property characteristics, and property restrictions ave formalized according to the model. Experiment results described in Web ontology language prove that our proposed approach is feasible for applying in the semantic objects project of semantic computing laboratory in UC Irvine. Our approach reduces about twenty percent constructing time compared with the ontology construction from relational databases.

A Distribution Management System for Relational Databases in Cloud Environments

For a transaction processing system to operate effectively and efficiently in cloud environments, it is important to distribute huge amount of data while guaranteeing the ACID （atomic, consistent, isolated, and durable） properties. Moreover, database partition and migration tools can help transplanting conventional relational database systems to the cloud environment rather than rebuilding a new system. This paper proposes a database distribution management （DBDM） system, which partitions or replicates the data according to the transaction behaviors of the application system. The principle strategy of DBDM is to keep together the data used in a single transaction, and thus, avoiding massive transmission of records in join operations. The proposed system has been implemented successfully. The preliminary experiments show that the DBDM performs the database partition and migration effectively. Also, the DBDM system is modularly designed to adapt to different database management system （DBMS） or different partition algorithms.

CASE STORAGE BASED ON RELATIONAL DATABASE

This paper focused on the integration of case base and relational database management system (RDBMS). The organizational and commercial impact will be far greater if the case based reasoning (CBR) system is integrated with main stream information system, which is exemplified by RDBMS. The scalability, security and robustness provided by a commercial RDBMS facilitate the CBR system to manage the case base. The virtual table in relational database (RDB) is important for CBR systems to implement the flexibility of case template. It was discussed how to implement a flexible and succinct case template, and a mapping model between case template and RDB was proposed. The key idea is to build the case as the virtual view of underlying data.

PORLES:A Parallel Object Relational Database System

We developed a parallel object relational DBMS named PORLES. It uses BSP model as its parallel computing model, and monoid calculus as its basis of data model. In this paper, we introduce its data model, parallel query optimization, transaction processing system and parallel access method in detail.

Spatio-temporal Data Model Based on Relational Database System

In this paper,the entity_relation data model for integrating spatio_temporal data is designed.In the design,spatio_temporal data can be effectively stored and spatiao_temporal analysis can be easily realized.

An Efficient Schema Transformation Technique for Data Migration from Relational to Column-Oriented Databases

Data transformation is the core process in migrating database from relational database to NoSQL database such as column-oriented database. However,there is no standard guideline for data transformation from relational database toNoSQL database. A number of schema transformation techniques have been proposed to improve data transformation process and resulted better query processingtime when compared to the relational database query processing time. However,these approaches produced redundant tables in the resulted schema that in turnconsume large unnecessary storage size and produce high query processing timedue to the generated schema with redundant column families in the transformedcolumn-oriented database. In this paper, an efficient data transformation techniquefrom relational database to column-oriented database is proposed. The proposedschema transformation technique is based on the combination of denormalizationapproach, data access pattern and multiple-nested schema. In order to validate theproposed work, the proposed technique is implemented by transforming data fromMySQL database to MongoDB database. A benchmark transformation techniqueis also performed in which the query processing time and the storage size arecompared. Based on the experimental results, the proposed transformation technique showed significant improvement in terms query processing time and storagespace usage due to the reduced number of column families in the column-orienteddatabase.

Chinese Keyword Search by Indexing in Relational Databases

In this paper, we propose a new method based on index to realize IR-style Chinese keyword search with ranking strategies in relational databases. This method creates an index by using the related information of tuple words and presents a ranking strategy in terms of the nature of Chinese words. For a Chinese keyword query, the index is used to match query search words and the tuple words in index quickly, and to compute similarities between the query and tuples by the ranking strategy, and then the set of identifiers of candidate tuples is generated. Thus, we retrieve top-N results of the query using SQL selection statements and output the ranked answers according to the similarities. The experimental results show that our method is efficient and effective.

A Database Querying Language for Formulating Relational Queries on Small Devices

For small devices like the PDAs and mobile phones, formulation of relational database queries is not as simple as using conventional devices such as the personal computers and laptops. Due to the restricted size and resources of these smaller devices, current works mostly limit the queries that can be posed by users by having them predetermined by the developers. This limits the capability of these devices in supporting robust queries. Hence, this paper proposes a universal relation based database querying language which is targeted for small devices. The language allows formulation of relational database queries that uses minimal query terms. The formulation of the language and its structure will be described and usability test results will be presented to support the effectiveness of the language.

Research on the Mapping Technology of CIM and Relational Database in Power Grid

With the development of electric power industry,the requirement of information sharing and application integration between each application system is salience.To realize the real "sharing information,data maintenance uniform",and effectively eliminate "island of information",a standard,open information model of power system should be followed urgently by different systems,and a common data interface should be provided.The Common Information Model(CIM) proposed by standard of IEC-61970 solve the problem effectively.The characteristics of the CIM Model and relational database of power system are analyzed,a mapping method between CIM model based on standard of IEC61970 and relational database is proposed,and corresponding problems between object-oriented model and the relational model are solved flexiblely.

On Detecting and Enforcing the Non-Relational Constraints Associated to Dyadic Relations in MatBase

MatBase is a prototype data and knowledge base management expert intelligent system based on the Relational,Entity-Relationship,and(Elementary)Mathematical Data Models.Dyadic relationships are quite common in data modeling.Besides their relational-type constraints,they often exhibit mathematical properties that are not covered by the Relational Data Model.This paper presents and discusses the MatBase algorithm that assists database designers in discovering all non-relational constraints associated to them,as well as its algorithm for enforcing them,thus providing a significantly higher degree of data quality.

Semantic-based query processing for relational data integration

To solve the query processing correctness problem for semantic-based relational data integration,the semantics of SAPRQL（simple protocol and RDF query language） queries is defined.In the course of query rewriting,all relative tables are found and decomposed into minimal connectable units.Minimal connectable units are joined according to semantic queries to produce the semantically correct query plans.Algorithms for query rewriting and transforming are presented.Computational complexity of the algorithms is discussed.Under the worst case,the query decomposing algorithm can be finished in O（n2） time and the query rewriting algorithm requires O（nm） time.And the performance of the algorithms is verified by experiments,and experimental results show that when the length of query is less than 8,the query processing algorithms can provide satisfactory performance.

A method for publishing relational schema into DTD

This paper focuses on exporting relational data into extensible markup language (XML). First, the characteristics of both relational schemas represented by E-R diagrams and XML document type definitions (DTDs) are analyzed. Secondly, the corresponding mapping rules are proposed. At last an algorithm based on edge tables is presented. There are two key points in the algorithm. One is that the edge table is used to store the information of the relational dictionary, and this brings about the efficiency of the algorithm. The other is that structural information can be obtained from the resulting DTDs and other applications can optimize their query processes using the structural information.

基于面向对象技术和标准关系数据库的Geodatabase的研究

面向对象技术为空间数据模型的发展提出了新的要求。本论文在此背景下,回顾了空间数据模型的发展历程,从整体上介绍了第三代基于面向对象技术和关系数据库的Geodatabase数据模型,并详细介绍了其体系结构及在关系数据库中的存储。最后本文通过总结Geodatabase模型的优缺点,提出了未来空间数据模型的发展趋势。

利用Geodatabase建模

本文介绍了采用面向对象技术的新一代地理数据模型Geodatabase的特点,举例说明了利用Geodatabase数据模型对地理对象建模的过程及其在数字中国地理空间框架建设中的重要意义。

A Novel Database Watermarking Technique Using Blockchain as Trusted Third Party

With widespread use of relational database in various real-life applications,maintaining integrity and providing copyright protection is gaining keen interest of the researchers.For this purpose,watermarking has been used for quite a long time.Watermarking requires the role of trusted third party and a mechanism to extract digital signatures(watermark)to prove the ownership of the data under dispute.This is often inefficient as lots of processing is required.Moreover,certain malicious attacks,like additive attacks,can give rise to a situation when more than one parties can claim the ownership of the same data by inserting and detecting their own set of watermarks from the same data.To solve this problem,we propose to use blockchain technology—as trusted third party—along with watermarking for providing a means of rights protection of relational databases.Using blockchain for writing the copyright information alongside watermarking helps to secure the watermark as changing the blockchain is very difficult.This way,we combined the resilience of our watermarking scheme and the strength of blockchain technology—for protecting the digital rights information from alteration—to design and implement a robust scheme for digital right protection of relational databases.Moreover,we also discuss how the proposed scheme can also be used for version control.The proposed technique works with nonnumeric features of relational database and does not target only selected tuple or portion(subset)from the database for watermark embedding unlike most of the existing techniques;as a result,the chances of subset selection containing no watermark decrease automatically.The proposed technique employs zerowatermarking approach and hence no intentional error(watermark)is added to the original dataset.The results of the experiments proved the effectiveness of the proposed scheme.