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

27th Annual International Computer Software and Applications Conference

作者： Leguizamo, CP Wang, D Mori, K Tokyo Inst Technol Dept Comp Sci Meguro Ku Tokyo 1528552 Japan

ISBN: (纸本)0769520200

Due to the progress of information technology and wide spread of e-business, the market has become diversified and highly dynamic based on changing users' preferences. To meet the extensive competition in a dynamic environment, Autonomous Decentralized database System based on autonomous coordinating subsystems has been proposed. Autonomy and decentralization of subsystems help achieving high response time in highly competitive situation and an autonomous Mobile Agent based coordination has been proposed to achieve flexibility in a highly dynamic environment. Further, the system is provided with autonomous reconstruction to coordinate the heterogeneous requirements of multiple subsystem. Based on the complementary requirements of the subsystems, heterogeneity distribution has been defined to accomplish the reconstruction process. This autonomous reconstruction consists of autonomous division and autonomous integration of the system, based on the ever changing situation, to assure high response time.

关键词： distributed database e-business mobile agent autonomous reconstruction

来源：评论

学校读者我要写书评

暂无评论

Designing a distributed database on a local area network: a methodology and decision support system

引用

INFORMATION AND SOFTWARE TECHNOLOGY 2000年第3期42卷 171-184页

作者： Lee, H Park, YK Jang, G Huh, SY Korea Adv Inst Sci & Technol Grad Sch Management Corp Informat Syst Lab Dongdaemoon Gu Seoul 130012 South Korea LG LCD Ltd Kangnam Gu Seoul 135280 South Korea Oracle Korea Ltd Nam Gu Ulsan 680030 South Korea Korea Adv Inst Sci & Technol Grad Sch Management Database Applicat Lab Dongdaemoon Gu Seoul 130012 South Korea

Local area networks (LANs) are important for an enterprise to hold a competitive edge. Many companies have therefore converted terminal-based computing systems to LAN-based distributed data processing systems. This paper proposes a design methodology for distributed databases connected by a LAN. Two primary objectives of the methodology are: (i) to allocate data files and workload among heterogeneous servers;and (ii) to determine the number of servers to satisfy the response time required for processing each transaction. The file and workload allocation decision is formulated as a nonlinear zero-one integer programming problem. This problem is proven to be NP-complete. A heuristic is developed to solve this problem effectively. A decision support system is implemented and an example is solved to illustrate the practical usefulness of the system. (C) 2000 Elsevier Science B.V. All rights reserved.

关键词： distributed database decision support system local area network file and workload allocation nonlinear integer programming local processing overhead server service capacity

来源：评论

学校读者我要写书评

暂无评论

What's in a name [Internet Domain Name System]

引用

IEE Review 2003年第11期49卷 38-40页

作者： R. Dettmer

Paul Mockapetris is the inventor of the Internet's Domain Name System. This article discusses why domain names are booming on the Net. As originally envisaged, the DNS was restricted to matching domain names and IP addresses, but Mockapetris decided to "overstep" his mandate and design a system that could be extended to include additional data types. As the DNS has grown in scale, its attractions as a distributed database have become increasingly powerful. There are currently some two million DNS servers on the public Internet, and around five times that number behind corporate firewalls contributing to the DNS's caching activity.

关键词： corporate firewalls Internet Domain Name System DNS servers distributed database Internet caching activity domain names distributed databases Web sites public Internet IP addresses Information networks distributed databases

来源：评论

学校读者我要写书评

暂无评论

A distributed Parallel System for Face Recognition

A Distributed Parallel System for Face Recognition

引用

The Fourth International Conference on Parallel and distributed Computing, Applications and Technologies

作者： JIANG Chunhong SU Guangda LIU Xiaodong The State Key Laboratory of Intelligent Technology and System Electronic Engineering DepartmentTsinghua University

This paper presents a distributed parallel system for face *** face database in mis system is so huge(more man 1,000 thousand faces) that matching and recognition processes can not be carried out on only one *** cluster system must be used to improve the matching *** many current clusters existing have some problems and can not fit our system.A special distributed parallel system was developed to complete face query and *** concept of parallel virtual machine and a kind of linked table structure adopted in this system not only decreased lots of moving overhead of adding or deleting nodes in the array structure but also truly realized the infinite ***,key techniques such as distributed database,buffer and synchronization techniques in communication and multithreading in control flow were adopted to guarantee the normal *** results proved mat this parallel system can improve the matching speed for more than 4 ***,the greatest advantage of this system is not only increasing matching speed but breaking the upper limit of face data ***,the face data capability of this system can be extended to arbitrary figure as bigger as possible.

关键词： distributed parallel system distributed database face recognition parallel virtual machine

来源：评论

学校读者我要写书评

暂无评论

Optimizing Intranet Topology Under Enterprise Information System’s Requirements

Optimizing Intranet Topology Under Enterprise Information Sy...

引用

The Second International Conference on Information and Management Sciences

作者： Jau-Ji Shen Tzung-Liang Hung Department of Information Management Chaoyang University of Technology 168 GiFeng E. Rd WuFeng Taichung County Taiwan 413 China

＜正＞ An enterprise often seeks an efficient and effective method for information communication within the organization. The establishment of the intranet is widely used for this purpose. In previous intranet design related researches, heuristic algorithms are often used to find the optimal solutions. In this paper, a method for intranet design will be proposed by establishing an ontology schema for the organizational data, and then sketching an intranet topological design to achieve a deterministic solution. An intranet based on this method can not only fulfill the requirements of the enterprise information system but also piovide the minimum total unit transmission costs by using the lower layout costs.

关键词： Base relation distributed database Enterprise organization Intranet Network topology Ontology Transmission cost

来源：评论

学校读者我要写书评

暂无评论

The Concept of Effective Incremental Maintenance for View in Data Warehousing

The Concept of Effective Incremental Maintenance for View in...

引用

The Second International Conference on Information and Management Sciences

作者： Jau-Ji Shen Yi-Pei Hsieh Department of Information Management Chaoyang University of Technology 168 GiFeng E. Rd WuFeng Taichung County Taiwan 413 China

＜正＞ Through materialized views, data warehouse （DW） is improved for the availability and efficiency of the queries. However, storing data repetitively makes it difficult to maintain the consistency with the data in materialized views when changes occur in base relations. Therefore, the maintenance of the materialized views should be considered. In the recent years, many researches discuss this type of problems and provide many methods to maintain materialized views. Among these methods, the definition of materialized views is often ignoring the logic relation of relational database schema. Hence, in this paper, the materialized view is defined based on the relational database schema. For the method of materialized views maintenance, an effective incremental maintenance concept is proposed for materialized views. The maintenance operations will be further discussed in two cases as tuples insertion and deletion such that an effective algorithm can be derived to lower the maintenance cost.

关键词： distributed database Data Warehouse Materialized View Effective Incremental Maintenance

来源：评论

学校读者我要写书评

暂无评论

An approximate method for minimizing the communications cost of the replication routing schedule for a distributed database

引用

ELECTRONICS AND COMMUNICATIONS IN JAPAN PART I-COMMUNICATIONS 2000年第1期83卷 73-86页

作者： Wakahara, Y Kokusai Denshin Denwa Co Ltd Res & Dev Labs Kamifukuoka Saitama 3568502 Japan

In distributed databases for general-purpose business software, such as groupware, the asynchronous replication update method is widely employed to assure coincidence in the contents of the database;the replications of other databases retained in each database are updated simultaneously according to a predetermined schedule. This article discusses the approximate scheduling in such a distributed database that minimizes the communications cost of updating the replications, More precisely, as the first step, we consider the case in which two-way concurrent transmission is allowed in each link, and the communications cost is proportional to the communication time required for the transfer. The problem of deriving the schedule to minimize the communications cost is formulated. As a practical method of solving that problem, a heuristic method that effectively derives the approximate schedule with a communications cost close to the minimum is proposed. A quantitative evaluation of the proposed method is presented, and it is shown that a schedule very close to the optimal solution is obtained if the communications cost coefficient of the links is almost the same. (C) 1999 Scripta Technica.

关键词： replication schedule distributed database groupware communications cost

来源：评论

学校读者我要写书评

暂无评论

An Efficient Procedure for Maintaining Materialized Views on distributed database Systems

引用

Systems and Computers in Japan 2000年第4-6期31卷 86-96页

作者： Kasukawa, Takeya Nakanishi, Michio Matsuda, Hideo Hashimoto, Akihiro Grad. School of Engineering Science Osaka University Toyonaka 560-8531 Japan Educ. Ctr. for Info. Processing Osaka University Toyonaka 560-8531 Japan

This paper considers a distributed database represented by the relational model, and proposes an efficient procedure to reflect the update of the base relation for materialized views defined by the inequality query from the base relation in the element database. Methods to reflect updates of the base relation on the materialized views in the distributed database include a method that calculates the tuple inserted or deleted for the materialized view due to the update of the base relation, using the existing query processing procedure, as well as a method that stores the copy of the base relation to be utilized in the database containing the materialized view. The method proposed in the paper is to store and utilize the key attribute value of the tuple satisfying a part of the inequality query condition as the materialized view, independently of the originally considered materialized view. By this mechanism, the communication cost in query processing can be reduced. The required memory area can also be reduced, compared to the case where the copy of the base relation is directly stored. This paper shows the validity of the proposed method, and compares the communication cost and the amount of data to be stored, versus the existing method. It is also shown that the proposed method is useful in the database for molecular biology. © 2000 Scripta Technica.

关键词： distributed database materialized view update reflection processing inequality query

来源：评论

学校读者我要写书评

暂无评论

An approximate method for minimizing communications cost and time for replication update of distributed databases

引用

ELECTRONICS AND COMMUNICATIONS IN JAPAN PART I-COMMUNICATIONS 2002年第4期85卷 61-70页

作者： Wakahara, Y KDD R&D Labs Kamifukuoka Saitama 3568502 Japan

In distributed databases, oriented toward general business software such as groupware, the asynchronous update method is widely used in order to align the databases. In this method, each database has replicas of the other databases, and the replicas are updated at the same time according to a predetermined replica routing schedule. This paper discusses an approximate method for minimizing the communication cost and time needed for updating the replicas in such a distributed database. More precisely, the case in which the communication cost is proportional to the amount of transferred data is considered, and an optimization problem is formulated in which the replication routing schedule minimizing the time for the replica update is to be determined from those minimizing the communication cost for the replica update. An approximate solution for the formulated problem is presented. Then the result of evaluation of the approximate replication routing schedule obtained as the approximate solution is discussed, and it is shown that the communication cost for replica update is minimized and that the time for the replica update is at most 1.2 times the minimum value if the number of distributed databases is at most 7. (C) 2001 Scripta Technica.

关键词： routing replica schedule distributed database groupware

来源：评论

学校读者我要写书评

暂无评论

Mobile data and transaction management

引用

INFORMATION SCIENCES 2002年第3-4期141卷 279-309页

作者： Madria, SK Mohania, M Bhowmick, SS Bhargava, B Univ Missouri Dept Comp Sci Rolla MO 65401 USA IBM India Res Lab New Delhi India Nanyang Technol Univ Sch Comp Engn Singapore 2263 Singapore Purdue Univ Dept Comp Sci W Lafayette IN 47907 USA

Mobile computing paradigm has emerged due to advances in wireless or cellular networking technology. This rapidly expanding technology poses many challenging research problems in the area of mobile database systems. The mobile users can access information independent of their physical location through wireless connections. However, accessing and manipulating information without restricting users to specific locations complicates data processing activities. There are computing constraints that make mobile database processing different from the wired distributed database computing. In this paper, we survey the fundamental research challenges particular to mobile database computing, review some of the proposed solutions and identify some of the upcoming research challenges. We discuss interesting research areas, which include mobile location data management, transaction processing and broadcast, cache management and replication and query processing. We highlight new upcoming research directions in mobile digital library, mobile data warehousing, mobile workflow and mobile web and e-commerce. (C) 2002 Elsevier Science Inc. All rights reserved.

关键词： mobile computing wireless or cellular networking mobile database distributed database

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：