Use of Component Integration Services in Multidatabase Systems: A Feasible Solution for Integrating Academic Institutions or Commercial Industries

The book chapter is an extended version of the research paper entitled “Use of Component Integration Services in Multidatabase Systems”, which is presented and published by the 13th ISITA, the National Conference of Recent Trends in Mathematical and Computer Sciences, T.M.B. University, Bhagalpur, India, January 3-4, 2015. Information is widely distributed across many remote, distributed, and autonomous databases (local component databases) in heterogeneous formats. The integration of heterogeneous remote databases is a difficult task, and it has already been addressed by several projects to certain extents. In this chapter, we have discussed how to integrate heterogeneous distributed local relational databases because of their simplicity, excellent security, performance, power, flexibility, data independence, support for new hardware technologies, and spread across the globe. We have also discussed how to constitute a global conceptual schema in the multidatabase system using Sybase Adaptive Server Enterprise’s Component Integration Services (CIS) and OmniConnect. This is feasible for higher education institutions and commercial industries as well. Considering the higher educational institutions, the CIS will improve IT integration for educational institutions with their subsidiaries or with other institutions within the country and abroad in terms of educational management, teaching, learning, and research, including promoting international students’ academic integration, collaboration, and governance. This will prove an innovative strategy to support the modernization and large expansion of academic institutions. This will be considered IT-institutional alignment within a higher education context. This will also support achieving one of the sustainable development goals set by the United Nations: “Goal 4: ensure inclusive and quality education for all and promote lifelong learning”. However, the process of IT integration into higher educational institutions must be thoroughly evaluated, identifying the vital data access points. In this chapter, Section 1 provides an introduction, including the evolution of various database systems, data models, and the emergence of multidatabase systems and their importance. Section 2 discusses component integration services (CIS), OmniConnect and considering heterogeneous relational distributed local databases from the perspective of academics, Section 3 discusses the Sybase Adaptive Server Enterprise (ASE), Section 4 discusses the role of component integration services and OmniConnect of Sybase ASE under the Multidatabase System, Section 5 shows the database architectural framework, Section 6 provides an implementation overview of the global conceptual schema in the multidatabase system, Section 7 discusses query processing in the CIS, and finally, Section 8 concludes the chapter. The chapter will help our students a lot, as we have discussed well the evolution of databases and data models and the emergence of multidatabases. Since some additional useful information is cited, the source of information for each citation is properly mentioned in the references column.

A dynamic crash recovery scheme for distributed real-time database systems

Recovery performance in the event of failures is very important for distributed real-time database systems. This paper presents a time-cognizant logging-based crash recovery scheme （TCLCRS） that aims at distributed real-time databases, which adopts a main memory database as its ground support. In our scheme, each site maintains a real-time log for local transactions and the subtransactions, which execute at the site, and execte local checkpointing independently. Log records are stored in non-volatile high- speed store, which is divided into four different partitions based on transaction classes. During restart recovery after a site crash, partitioned crash recovery strategy is adopted to ensure that the site can be brought up before the entire local secondary database is reloaded in main memory. The partitioned crash recovery strategy not only guarantees the internal consistency to be recovered, but also guarantee the temporal consistency and recovery of the sates of physical world influenced by uncommitted transactions. Combined with two- phase commit protocol, TCLCRS can guarantee failure atomicity of distributed real-time transactions.

Weak Serializable Concurrency Control in Distributed Real-Time Database Systems

Most of the proposed concurrency control protocols for real time database systems are based on serializability theorem. Owing to the unique characteristics of real time database applications and the importance of satisfying the timing constraints of transactions, serializability is too strong as a correctness criterion and not suitable for real time databases in most cases. On the other hand, relaxed serializability including epsilon serializability and similarity serializability can allow more real time transactions to satisfy their timing constraints, but database consistency may be sacrificed to some extent. We thus propose the use of weak serializability(WSR) that is more relaxed than conflicting serializability while database consistency is maintained. In this paper, we first formally define the new notion of correctness called weak serializability. After the necessary and sufficient conditions for weak serializability are shown, corresponding concurrency control protocol WDHP(weak serializable distributed high priority protocol) is outlined for distributed real time databases, where a new lock mode called mask lock mode is proposed for simplifying the condition of global consistency. Finally, through a series of simulation studies, it is shown that using the new concurrency control protocol the performance of distributed real time databases can be greatly improved.

A New Approach for Database Fragmentation and Allocation to Improve the Distributed Database Management System Performance

The efficiency and performance of Distributed Database Management Systems (DDBMS) is mainly measured by its proper design and by network communication cost between sites. Fragmentation and distribution of data are the major design issues of the DDBMS. In this paper, we propose new approach that integrates both fragmentation and data allocation in one strategy based on high performance clustering technique and transaction processing cost functions. This new approach achieves efficiently and effectively the objectives of data fragmentation, data allocation and network sites clustering. The approach splits the data relations into pair-wise disjoint fragments and determine whether each fragment has to be allocated or not in the network sites, where allocation benefit outweighs the cost depending on high performance clustering technique. To show the performance of the proposed approach, we performed experimental studies on real database application at different networks connectivity. The obtained results proved to achieve minimum total data transaction costs between different sites, reduced the amount of redundant data to be accessed between these sites and improved the overall DDBMS performance.

Scheduling transactions in mobile distributed real-time database systems

A DMVOCC-MVDA(distributed multiversion optimistic concurrency control with multiversion dynamic adjustment)protocol was presented to process mobile distributed real-time transaction in mobile broadcast environments.At the mobile hosts,all transactions perform local pre-validation.The local pre-validation process is carried out against the committed transactions at the server in the last broadcast cycle.Transactions that survive in local pre-validation must be submitted to the server for local final validation.The new protocol eliminates conflicts between mobile read-only and mobile update transactions,and resolves data conflicts flexibly by using multiversion dynamic adjustment of serialization order to avoid unnecessary restarts of transactions.Mobile read-only transactions can be committed with no-blocking,and respond time of mobile read-only transactions is greatly shortened.The tolerance of mobile transactions of disconnections from the broadcast channel is increased.In global validation mobile distributed transactions have to do check to ensure distributed serializability in all participants.The simulation results show that the new concurrency control protocol proposed offers better performance than other protocols in terms of miss rate,restart rate,commit rate.Under high work load(think time is 1s)the miss rate of DMVOCC-MVDA is only 14.6%,is significantly lower than that of other protocols.The restart rate of DMVOCC-MVDA is only 32.3%,showing that DMVOCC-MVDA can effectively reduce the restart rate of mobile transactions.And the commit rate of DMVOCC-MVDA is up to 61.2%,which is obviously higher than that of other protocols.

Quasi Serializable Concurrency Control in Distributed Real-Time Database Systems

This paper formally defines and analyses the new notion of correctness called quasi serializability, and then outlines corresponding concurrency control protocol QDHP for distributed real-time databases. Finally, through a series of simulation studies, it shows that using the new concurrency control protocol the performance of distributed real-time databases can be much improved.

An architecture for mobile database management system

In order to design a new kind of mobile database management system (DBMS)more suitable for mobile computing than the existent DBMS, the essence of database systems in mobilecomputing is analyzed. An opinion is introduced that the mobile database is a kind of dynamicdistributed database, and the concept of virtual servers to translate the clients' mobility to theservers' mobility is proposed. Based on these opinions, a kind of architecture of mobile DBMS, whichis of versatility, is presented. The architecture is composed of a virtual server and a local DBMS,the virtual server is the kernel of the architecture and its functions are described. Eventually,the server kernel of a mobile DBMS prototype is illustrated.

Structure design and establishment of database application system for alien species in Shandong Province,China

This paper presents a case study on structure design and establishment of database application system for alien species in Shandong Province, integrating with Geographic Information System, computer network, and database technology to the research of alien species. The modules of alien species database, including classified data input, statistics and analysis, species pictures and distribution maps, and out date input, were approached by Visual Studio.net 2003 and Microsoft SQL server 2000. The alien species information contains the information of classification, species distinction characteristics, biological characteristics, original area, distribution area, the entering fashion and route, invasion time, invasion reason, interaction with the endemic species, growth state, danger state and spatial information, i.e. distribution map. Based on the above bases, several models including application, checking, modifying, printing, adding and returning models were developed. Furthermore, through the establishment of index tables and index maps, we can also spatially query the data like picture, text and GIS map data. This research established the technological platform of sharing information about scientific resource of alien species in Shandong Province, offering the basis for the dynamic inquiry of alien species, the warning technology of prevention and the fast reaction system. The database application system possessed the principles of good practicability, friendly user interface and convenient usage. It can supply full and accurate information inquiry services of alien species for the users and provide functions of dynamically managing the database for the administrator.

DCAD:a Dual Clustering Algorithm for Distributed Spatial Databases

Spatial objects have two types of attributes: geometrical attributes and non-geometrical attributes, which belong to two different attribute domains (geometrical and non-geometrical domains). Although geometrically scattered in a geometrical domain, spatial objects may be similar to each other in a non-geometrical domain. Most existing clustering algorithms group spatial datasets into different compact regions in a geometrical domain without considering the aspect of a non-geometrical domain. However, many application scenarios require clustering results in which a cluster has not only high proximity in a geometrical domain, but also high similarity in a non-geometrical domain. This means constraints are imposed on the clustering goal from both geometrical and non-geometrical domains simultaneously. Such a clustering problem is called dual clustering. As distributed clustering applications become more and more popular, it is necessary to tackle the dual clustering problem in distributed databases. The DCAD algorithm is proposed to solve this problem. DCAD consists of two levels of clus- tering: local clustering and global clustering. First, clustering is conducted at each local site with a local clustering algorithm, and the features of local clusters are extracted. Second, local features from each site are sent to a central site where global clustering is obtained based on those features. Experiments on both artificial and real spatial datasets show that DCAD is effective and efficient.

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.

Research on the User Information Optimized Retrieval Technology in Distributed Database

The traditional method first classifies the user information and combines the query method to retrieve the interest information, but neglects to calculate the weight of the user interest information, which leads to the low retrieval accuracy. A retrieval method based on the fuzzy proximity classification technology is proposed. Approximation between the fuzzy sets is used to represent the consistency between the user interest information features, and the consistency calculation formula and the skewness confidence matrix between the user interest information features are given. The fuzzy classification of the user interest information can obtain the most consistent confidence data and eliminate the redundant approximation interference data. The probabilistic model of the information word frequency and the user interest information length calculates the weight of the user interest information, and adjusts the weight formula constantly.

Type-2 Neutrosophic Set and Their Applications in Medical Databases Deadlock Resolution

Electronic patient data gives many advantages,but also new difficulties.Deadlocks may delay procedures like acquiring patient information.Distributed deadlock resolution solutions introduce uncertainty due to inaccurate transaction properties.Soft computing-based solutions have been developed to solve this challenge.In a single framework,ambiguous,vague,incomplete,and inconsistent transaction attribute information has received minimal attention.The work presented in this paper employed type-2 neutrosophic logic,an extension of type-1 neutrosophic logic,to handle uncertainty in real-time deadlock-resolving systems.The proposed method is structured to reflect multiple types of knowledge and relations among transactions’features that include validation factor degree,slackness degree,degree of deadline-missed transaction based on the degree of membership of truthiness,degree ofmembership of indeterminacy,and degree ofmembership of falsity.Here,the footprint of uncertainty(FOU)for truth,indeterminacy,and falsity represents the level of uncertainty that exists in the value of a grade of membership.We employed a distributed real-time transaction processing simulator(DRTTPS)to conduct the simulations and conducted experiments using the benchmark Pima Indians diabetes dataset(PIDD).As the results showed,there is an increase in detection rate and a large drop in rollback rate when this new strategy is used.The performance of Type-2 neutrosophicbased resolution is better than the Type-1 neutrosophic-based approach on the execution ratio scale.The improvement rate has reached 10%to 20%,depending on the number of arrived transactions.

分支河流体系沉积学工作框架与流程

基于现有的研究成果和存在的问题,探讨了分支河流体系(DFS)研究中的关键科学问题、主要研究内容、研究方法和工作流程。研究结果表明:①DFS研究中最关键的3个科学问题是明确河网结构和河型演变规律、构建沉积标志和沉积模式、分析其形成和分布的控制因素。②DFS研究的主要内容包括建设形态沉积学数据库、现代沉积机理研究、分类研究、建立沉积模式、储层建模与储层预测等5个方面。③DFS研究中的关键技术包括基于遥感图像的形态数据采集、形成机理的水槽和模拟实验、河网重构、顶点位置预测与河道分汊点自动生成方法、储层建模知识库平台等。④DFS研究的基本工作流程是先建立形态沉积学数据库,搭建数据库软件平台,在此基础上选择具有代表性的DFS进行现代沉积解剖,然后综合现代沉积调查、露头解剖和模拟实验成果,形成分类体系,总结各类DFS的识别标志和沉积模式,分层次建立储层预测模型,形成沉积结构储层预测模型的建模软件平台,从而预测沉积体系中有利储层的分布。

面向分布式数据库的算子并行优化策略

随着网络技术的不断发展,数据规模呈现爆发式增长,使得传统的单机数据库逐步被分布式数据库所取代。分布式数据库采用节点协同工作方式解决了大规模数据存储问题,但由于增加了节点间通信开销,查询效率却不如单机数据库。分布式架构下,存储节点的数据仅用作多备份的冗余,为系统故障时提供数据恢复,并未被利用起来改善查询效率。针对上述问题,提出了一种面向分布式数据库的算子并行优化策略,通过对关键物理算子进行拆分,将拆分后的子请求均匀分配到存储层多个节点,由多个节点并行处理,从而减少查询响应时间。上述策略已经在分布式数据库CBase上进行了应用,实验表明,提出的并行优化策略可显著缩短SQL请求查询时间,并提高系统资源利用率。

高校图书馆手稿数字化与在线揭示的实践研究——以华东师范大学图书馆手稿数据库建设为例

国内高校图书馆收藏了大量的纸质手稿,但由于缺少数字化、长期保存以及在线揭示的整体解决方案,无法有效发挥其价值。本研究在手稿数据库需求分析的基础上,以华东师范大学手稿数据库建设为例,利用开源软件Goobi实现分布式手稿加工与发布,借助人工智能技术对手稿进行深度挖掘,基于IIIF的底层架构使特藏库可以整合国际知名文化遗产机构发布的手稿资源到本地。根据手稿资源的特点,构建手稿在线阅读图像工具、注释转录、手写识别、特征识别、自动标签等功能,提升用户体验。未来还将不断探索名人角色扮演参考咨询、多光谱三维手稿浏览以及手稿鉴定等功能,推动国内高校图书馆手稿数据库的建设。

基于人工智能技术的分布式数据库重复记录自动检测系统设计

以人工智能技术为基础前提的分布式数据库重复记录自动检测的方式,以提高数据库查询时的准确率以及查询效率。设计系统首先对数据信息进行对应的特征提取,而后通过权衡函数对样本信息进行整合,通过自适应分解得到相应的目标函数并求解,结合灰狼算法以及Shingle完成数据查询。经过算例验证,改进设计方式准确率均超过90%,平均耗时在35 s以内,满足自动查询快速精确的要求。

DDBS中实现分割数据库重构的一致性算法

如何使分割后的ＤＤＢＳ保持多复本之间的数据一致性，是ＤＤＢＳ中的一个重要问题．文中提出了一种有效的解决分割数据库重构的一致性算法，详细地介绍了算法的有关定义和详细描述．可以证明此算法是正确的和高效的．

基于Geodatabase数据模型和Case工具设计实现配电GIS数据库

传统的地理信息系统数据模型难以表达非结构化数据和GIS中具有复杂结构的数据,也不能表达继承、聚合等在GIS中广泛使用的关系。文章概述了Geodatabase模型的结构和特点,并针对配电网数据结构的特点,在Geodatabase模型的基础上,利用UML建模语言和ArcGIS提供的Case工具,设计并实现了配电GIS数据库。这种数据模型和设计方法比传统方法直观、简单且易于修改,对配电网的描述更贴切,利于数据库设计的优化,是设计空间数据库的一种较好的方法。

分布式数据库隐私数据细粒度安全访问控制研究

为控制隐私数据的细粒度安全访问行为,提出分布式数据库隐私数据细粒度安全访问控制。通过分布式数据库空间划分,过滤隐私数据,利用分区方程,分解数据库空间内隐私数据,将隐私数据反应函数的构建过程定义为对分布式数据库中隐私数据挖掘的博弈过程,获取博弈因子,将细粒度划分问题转化为隐私数据在最小二乘准则下的规划问题,划分隐私数据的细粒度。利用加密算法,对隐私数据加密,依据密钥分发算法为用户分发密钥,通过密钥转换,将加密后的隐私数据上传到分布式数据库,利用数据库验证用户的令牌是否包含隐私数据的信息,建立令牌请求机制,实现隐私数据的细粒度安全访问控制。实验结果表明,经过文中方法控制后,分布式数据库的响应性能有所提高,在保证正确性的同时,还可以提高对恶意访问行为的控制能力,具有较高的实际应用价值。