It is discussed that the warehouse management system is realized by using the features of the distributed database which is considered to be an independent one but scatters in different *** principle of the distribute...
详细信息
It is discussed that the warehouse management system is realized by using the features of the distributed database which is considered to be an independent one but scatters in different *** principle of the distributed warehouse management system,ODBC interface of PowerBuilder and the distributed structure of ORACLE is *** primary function of the warehouse management system is *** efficiency of the enterprise's warehouse management has been improved because of the realization of systematism,standardization and automatization of the warehouse management.
This paper analyzed the characteristics and requests of trust investment synthesized business system,and then designed and implemented a distributed database based on *** design and implementation were the embodiment ...
详细信息
This paper analyzed the characteristics and requests of trust investment synthesized business system,and then designed and implemented a distributed database based on *** design and implementation were the embodiment of the distributed database technology,which assured the security, reliability and flexibility of the database.
In the past decade, distributed multimedia data processing, i.e. the management of multimedia data objects from distributed data sources, has experienced an explosive development because of the technological advances ...
详细信息
In the past decade, distributed multimedia data processing, i.e. the management of multimedia data objects from distributed data sources, has experienced an explosive development because of the technological advances in distributed computing, network infrastructures, and multimedia streaming. With the proliferation of the third generation wireless networks, it is expected that multimedia data transmission and manipulation will achieve even larger growth in the next decade. The improved bandwidth and mobility of computing devices enable the possibility of accessing multimedia data ~{!0~}anytime, and anywhere~{!1~}, providing the foundation for mobile multimedia data management. At the same time, due to the characteristics of multimedia data (e.g. large data volume and lack of accurate semantic content representation), the existing multimedia information retrieval systems cannot guarantee accuracy, efficiency, and robustness when performing distributed content-based retrieval. In addition, the mobile environment has put further requirements on the manipulation of multimedia data: 1) The mobile computing devices are often disconnected from the network for prolonged periods of time due to the battery power limitations; 2) The network infrastructure is organized in a peer-to-peer fashion, making the traditional centralized or flooding-based search schemes ineffective; 3) The mobile computing devices in the network have frequent relocations, making it important to consider location information in the query processing; 4) The limitation of system resources (e.g. bandwidth and storage) require efficient approaches for handling voluminous multimedia data; and 5) The information retrieval system needs to integrate the heterogeneous and autonomous mobile data sources to provide a global framework for content-based multimedia data access. Generally, the overall performance of multimedia information retrieval is greatly influenced by the emerging issues in mobile networks. Despi
A scalable and effective algorithm called AMGMSP (Approximate Mining of Global Multidimensional Sequential Patterns) is proposed to solve the problem of mining the multidimensional sequential patterns for large databa...
详细信息
A scalable and effective algorithm called AMGMSP (Approximate Mining of Global Multidimensional Sequential Patterns) is proposed to solve the problem of mining the multidimensional sequential patterns for large databases in the distributed environment First, the multidimensional information is embedded into the corresponding sequences in order to convert the mining on the multidimensional sequential patterns to sequential *** the sequences are clustered, summarized, and analyzed on the distributed sites, and the local patterns could be obtained by the effective approximate sequential pattern mining ***, the global multidimensional sequential patterns could be mined by high vote sequential patterns after collecting all the local patterns on one *** the theories and the experiments indicate that this method could simplify the problem of mining the multidimensional sequential patterns and avoid mining the redundant *** global sequential patterns could be obtained effectively by the scalable method after reducing the cost of communication.
In this paper, a Graph-based semantic Data Model （GDM） is proposed with the primary objective of bridging the gap between the human perception of an enterprise and the needs of computing infrastructure to organize i...
详细信息
In this paper, a Graph-based semantic Data Model （GDM） is proposed with the primary objective of bridging the gap between the human perception of an enterprise and the needs of computing infrastructure to organize information in some particular manner for efficient storage and retrieval. The Graph Data Model （GDM） has been proposed as an alternative data model to combine the advantages of the relational model with the positive features of semantic data models. The proposed GDM offers a structural representation for interacting to the designer, making it always easy to comprehend the complex relations amongst basic data items. GDM allows an entire database to be viewed as a Graph （V, E） in a layered organization. Here, a graph is created in a bottom up fashion where V represents the basic instances of data or a functionally abstracted module, called primary semantic group （PSG） and secondary semantic group （SSG）. An edge in the model implies the relationship among the secondary semantic groups. The contents of the lowest layer are the semantically grouped data values in the form of primary semantic groups. The SSGs are nothing but the higher-level abstraction and are created by the method of encapsulation of various PSGs, SSGs and basic data elements. This encapsulation methodology to provide a higher-level abstraction continues generating various secondary semantic groups until the designer thinks that it is sufficient to declare the actual problem domain. GDM, thus, uses standard abstractions available in a semantic data model with a structural representation in terms of a graph. The operations on the data model are formalized in the proposed graph algebra. A Graph Query Language （GQL） is also developed, maintaining similarity with the widely accepted user-friendly SQL. Finally, the paper also presents the methodology to make this GDM compatible with the distributed environment, and a corresponding query processing technique for distributed environment is also sugg
In this paper, we address the three-machine flowshop scheduling problem. Setup times are considered separate from processing times, and the objective is to minimize total completion time. We show that the three-site d...
详细信息
In this paper, we address the three-machine flowshop scheduling problem. Setup times are considered separate from processing times, and the objective is to minimize total completion time. We show that the three-site distributed database scheduling problem can be modeled as a three-machine flowshop scheduling problem. A lower bound is developed and a dominance relation is established. Moreover, an upper bound is developed by using a three-phase hybrid heuristic algorithm. Furthermore, a branch-and-bound algorithm, incorporating the developed lower bound, dominance relation, and the upper bound is presented. Computational analysis on randomly generated problems is conducted to evaluate the lower and upper bounds, the dominance relation, and the branch-and-bound algorithm. The analysis shows the efficiency of the upper bound, and, hence, it can be used for larger size problems as a heuristic algorithm. (c) 2005 Elsevier B.V. All rights reserved.
A distributed database system is subject to site failure and link failure. This paper presents a reactive system approach to achieving fault tolerance in such a system. The reactive system concepts are an attractive p...
详细信息
A distributed database system is subject to site failure and link failure. This paper presents a reactive system approach to achieving fault tolerance in such a system. The reactive system concepts are an attractive paradigm for system design, development and maintenance because it separates policies from mechanisms. In the paper we give a solution using different reactive modules to implement the fault tolerant policies and the failure detection mechanisms. The solution shows that they can be separated without impact on each other;thus the system can adapt to constant changes in environments and user requirements.
When datasets are distributed on different sources, finding out matched data while preserving the privacy of the datasets is a widely required task. In this paper, we address two matching problems against the private ...
详细信息
ISBN:
(纸本)9783540494966
When datasets are distributed on different sources, finding out matched data while preserving the privacy of the datasets is a widely required task. In this paper, we address two matching problems against the private datasets on N (N >= 2) parties. The first one is the Privacy Preserving Set Intersection (PPSI) problem, in which each party wants to learn the intersection of the N private datasets. The second one is the Privacy Preserving Set Matching (PPSM) problem, in which each party wants to learn whether its elements can be matched in any private set of the other parties. For the two problems we propose efficient protocols based on a threshold cryptosystem which is additive homomorphic. In a comparison with the related work in [18], the computation and communication costs of our PPSI protocol decrease by 81% and 17% respectively, and the computation and communication costs of our PPSM protocol decrease by 80% and 50% respectively. In practical utilities both of our protocols save computation time and communication bandwidth.
暂无评论