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

International Conference on Cooperative Information Systems

作者： P. Thiran J.-L. Hainaut S. Bodart A. Deflorenne J.-M. Hick Institut dInformatique University of Namur Namur Belgium

Accessing and managing data from several existing independent databases pose complex problems that can be classified into platform, DMS, location and semantic levels. This paper describes a general architecture, a methodology and a CASE environment intended to address the problem of providing users and programmers with an abstract interface to independent heterogeneous and distributed databases. The architecture comprises a hierarchy of mediators that dynamically transform actual data into a virtual homogeneous database. Each layer provides a certain kind of independence. The InterDB approach provides a complete methodology to define this architecture, including schema recovery through reverse engineering, database integration and mapping building. The methodology is supported by the DB-MAIN CASE tool that helps to generate the mediators and their repository.

关键词： distributed databases Computer aided software engineering Programming profession Costs Identity-based encryption Electronic switching systems Reverse engineering Management information systems Radio access networks Hardware

来源：评论

学校读者我要写书评

暂无评论

Application of Mojette Transform in Internet distributed databases

Application of Mojette Transform in Internet Distributed Dat...

引用

IEEE International Conference on Intelligent Engineering Systems (INES)

作者： P. Serfozo J. Vasarhelyi J. Turan Department of Automation Egyetemváros 1 1 University of Miskolc Miskolc Hungary Department of Multimedia Communication Technical University of Kosice Slovakia Department of Multimedia Communication Technical University of Kosice

In the last twelve years there were intensive researches to find new methods for image processing. One of these methods is the Mojette transform (MOT). This transform is an exact discrete Radon transform defined for a set of specific projections. The MOT is used mainly in image processing applications. There were several implementation using personal computers. There are some applications where real time computing is a must, but the implementations before can not accomplish this requirement. There is analyzed the Mojette algorithm implementation for images of 256times256 pixels. There is also presented the implementation of MOT and Inverse Mojette transform (IMOT) on embedded reconfigurable platform. The paper outline the development work based on Xilinx ML310 board.

关键词： Internet distributed databases Discrete transforms Image processing Application software Image databases Microcomputers Image analysis Algorithm design and analysis Pixel

来源：评论

学校读者我要写书评

暂无评论

On the heterogeneity of distributed databases integrating commit protocols

On the heterogeneity of distributed databases integrating co...

引用

International Conference on distributed Computing Systems

作者： C.V. Papadopoulos Department of Computer Science and Computing Division Greek University of Finace (KEPYO) University of Piraeus Greece

Explores atomic commitment among heterogeneous distributed databases. Two cases are considered, one where the individual databases participating in the system do not externalize their commit protocols, and one where the participating databases do externalize their commit protocols. With regard to the latter case, I propose new heterogeneous commit protocols, one for joining databases that have different 2-phase commit protocols, and one for uniting databases which employ a 3-phase protocol with others employing a 2-phase commit protocol.< >

关键词： distributed databases Protocols Transaction databases Spatial databases Computer science distributed computing Finance Data security Concurrency control System recovery

来源：评论

学校读者我要写书评

暂无评论

A Novel Outlier Detection Algorithm for distributed databases

A Novel Outlier Detection Algorithm for Distributed Database...

引用

International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Jiaogen Zhou Chunjiang Zhao You Wan Wenjiang Huang Baozhu Yang Jixin Ge NERCITA Beijing Academy of Agriculture and Forestry Sciences Beijing China IRSA CAS Beijing China International School of Software Wuhan University of China Wuhan China Information Center of Beijing Municipal Rural Affair Committee Beijing China

Traditional outlier detection algorithms are designed to apply to centralized databases, not distributed databases. We proposed a novel outlier detection algorithm for distributed databases. Given data assigned to different network nodes of a network platform, where each node has its own memory and hard disc, and the communication between nodes driven by message, the populated data would be non-overlapping. The working way of the network system is a manager-worker mode, that is, that a node as manager is responsible for assigning tasks to worker and querying the results from worker nodes. The algorithm first detected local outliers based on distance on all nodes, and then identified local outliers collected in the central node where a globally screening operation on all local outliers was implemented to achieve really global outliers. To scale the algorithm to massive data and reduce its computing complexity, a data filtering technology was further presented. Experimental results demonstrated that the algorithm effectively and efficiently handled on real and artificial data.

关键词： Detection algorithms distributed databases Clustering algorithms Algorithm design and analysis Filtering Statistical distributions Classification algorithms Nearest neighbor searches distributed computing Application software

来源：评论

学校读者我要写书评

暂无评论

Frequent Closed Itemset Mining with Privacy Preserving for distributed databases

Frequent Closed Itemset Mining with Privacy Preserving for D...

引用

IEEE International Conference on Data Mining Workshops (ICDM Workshops)

作者： Shin-ya Kuno Koichiro Doi Akihiro Yamamoto Nomura Research Institute Limited Japan Department of Intelligence Science and Technology Graduate School of Informatics Kyoto University Kyoto Japan Department of Computational Biology Department of Frontier Sciences University of Tokyo Chiba Japan

In the present paper we introduce closed item sets into frequent item set mining from horizontally-partitioned transaction databases with preserving privacy. Closed item sets were originally from the research area of Formal Concept Analysis, and it is shown that even if results of frequent item set mining are restricted to closed item sets, all frequent item sets can be recovered from the results. This property suggests that using closed item sets would contribute to decreasing the cost of communication among distributed sites where a piece of horizontally-partitioned database is stored. We present a mining procedure revising and amalgamating two previous works: one is for mining closed item sets from horizontally-partitioned databases, and the other is for privacy preserving mining of item sets from such databases. We analyze the procedure on both of the viewpoint of communication cost and that of security. We also show results of some experimental practice of applying the procedure to a well-known dataset.

关键词： Itemsets distributed databases Data privacy Protocols Silicon

来源：评论

学校读者我要写书评

暂无评论

An optimized strategy for replication in Peer-to-Peer distributed databases

An optimized strategy for replication in Peer-to-Peer Distri...

引用

IEEE International Conference on Computational Intelligence and Computing Research

作者： D. I. George Amalarethinam C. Balakrishnan Department of Computer Science Jamal Mohamed College Tiruchirappalli India Department of Computer Science Saint Joseph's College Tiruchirappalli India

ISBN: (纸本)9781467313421

Availability of data in distributed databases improves the QoS factors like, fault tolerance and response time. An efficient Replication management results in high degree of availability. The Replication of data among sites increases the success possibilities during the recovery. Replication is one part of the well known issue called Data Allocation Problem along with Allocation in the design phase of distributed databases. The Allocation improves accessibility of data. The Data Allocation Problem is a NP-Hard in its nature. Hence it requires an optimized solution for improved results. As a result of the current trends in research towards a better Allocation and Replication strategy with the usage of Optimization techniques, this paper proposes a methodology for replication of fragments in Peer-to-Peer environment with Hungarian Assignment Algorithm of optimization technique. The simulation results suggest that the population of successful queries is increased better than the initial and reallocation of fragments across the sites.

关键词： FlexiPeer Hungarian Assignment algorithm optimization technique Peer-to-Peer databases Reallocation Replication Replication allocation distributed databases design phases Fragments Database Nondeterministic polynomial-time hard data availability Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Performance modeling of distributed and replicated databases

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2000年第4期12卷 645-672页

作者： Nicola, M Jarke, M Informix Software Inc Los Gatos CA 95032 USA Rhein Westfal TH Aachen D-52056 Aachen Germany GMD FIT D-53754 St Augustin Germany

This paper surveys performance models for distributed and replicated database systems. Over the last 20 years, a variety of such performance models have been developed and they differ in 1) which aspects of a real system are or are not captured in the model (e.g., replication, communication, nonuniform data access, etc.) and 2) how these aspects are modeled. We classify the different alternatives and modeling assumptions and discuss their interdependencies and expressiveness for the representation of distributed databases. This leads to a set of building blocks for analytical performance models. To illustrate the work that is surveyed, we select a combination of these proven modeling concepts and give an example of how to compose a balanced analytical model of a replicated database. We use this example to show how to derive meaningful performance values and to discuss the applicability and expressiveness of performance models for distributed and replicated databases. Finally, we compare the analytical results to measurements in a distributed database system.

关键词： performance models distributed databases replication interdatabase communication modeling assumptions queueing theory measurements benchmarks

来源：评论

学校读者我要写书评

暂无评论

DDB Expert: A Recommender for distributed databases Design

DDB Expert: A Recommender for Distributed Databases Design

引用

International Workshop on Database and Expert Systems Applications

作者： Rim Moussa UTIC Laboratory University of Tunis Carthage Tunisia CS Department University of Carthage Carthage Tunisia

This paper proposes a framework based on expert systems for distributed database design. The DB fragmentation advisor recommends table fragmentation or full/partial replication through DB schema analysis, DB workload analysis and DB statistics. The advisor is low cost, has a low memory footprint, and is very fast. The framework is flexible since it's open to workload changes with new business requirements or query/interaction's frequency changes as well as recommender enhancements with new rules.

关键词： distributed databases Benchmark testing Parallel processing Knowledge based systems Partitioning algorithms Production

来源：评论

学校读者我要写书评

暂无评论

A strategy for semantic integrity checking in distributed databases

A strategy for semantic integrity checking in distributed da...

引用

International Conference on Parallel and distributed Systems (ICPADS)

作者： H. Ibrahim Department of Computer Science Faculty of Computer Science and Information Technology Universiti Putra Malaysia Serdang Malaysia

Integrity constraints represent knowledge about data with which a database must be consistent. The process of checking constraints to ensure that the update operations or transactions which alter the database will preserve its consistency has proved to be extremely difficult to implement efficiently, particularly in a distributed environment. In the literature, most of the approaches/methods proposed for finding/deriving a good set of integrity constraints concentrate on deriving simplified forms of the constraints by analyzing both the syntax of the constraints and their appropriate update operations. These methods are based on syntactic criteria and are limited to simple types of integrity constraints. Also, these methods are only able to produce one integrity test for each integrity constraint. In Ibrahim, Gray, and Fiddian (1997), we introduced an integrity constraint subsystem for a relational distributed database. The subsystem consists of several techniques necessary for efficient constraint checking, particularly in a distributed environment where data distribution is transparent to application domain. However, the technique proposed for generating integrity tests is limited to several types of integrity constraints, namely: domain, key, referential and simple general semantic constraint and only produced two integrity tests (global and local) for a given integrity constraint. In this paper, we present a technique for deriving several integrity tests for a given integrity constraint where the following types of integrity constraints are considered: static and transition constraints.

关键词： distributed databases Transaction databases Testing Computer science Information technology Relational databases Algorithm design and analysis Costs Robustness distributed computing

来源：评论

学校读者我要写书评

暂无评论

System recovery in distributed databases

System recovery in distributed databases

引用

IEEE Annual International Computer Software and Applications Conference (COMPSAC)

作者： S.S. Isloor T.A. Marsland Department of Computing Science University of Alberta Edmonton Canada Bell Northern Research Limited Ottawa Canada

Recovery under a wide spectrum of system mal functions is considered in a distributed database environment. Knowledge of the nature of all the processes that access the data is effectively used to design system recovery protocols for different classes of transactions. A policy for optimal check pointing is derived through the use of a simple model, and an audit trail maintenance policy is outlined. The "domino effect" is modeled, and a rollback algorithm is developed.

关键词： System recovery distributed databases Transaction databases distributed computing Computer crashes Delay Interference distributed control Access protocols Database systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：