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

International Workshop on Knowledge Discovery and Data Mining (WKDD)

作者： Elnaz Zafarani Mohammad_Reza Feizi Derakhshi Hasan Asil Amir Asil Department of Computer Engineering Islamic Azad University Tabriz Iran Department of Computer Engineering Islamic Azad University Tabriz Branch Tabriz Iran Department of Computer University of Tabriz Tabriz Iran Department of Computer Islamic Azad University Tabriz branch (azarShahr) Tabriz Iran Industrial Management Instiyute Azerbayjan Tabriz Iran

ISBN: (纸本)9781424453979

Different methods have been presented to optimize the need to query processing optimization in databases. Reasons of these need increase the amount of data and the queries sent to the Database Management System. This article presents a multi agent system for heterogeneous distributed database by compiling two technologies of query processing optimization in database. This system is compatible of ordering adaptation and it is also flexible in adapting necessary changes as it progresses. In this system a new Algorithm based on modeling of users' long term requirements is used. In this system an Agent gathers data related to manner of users' usage from join in queries. Results of performances show that suggested Algorithm have high adaption ability with comparison to classic Algorithm.

关键词： Optimization methods Query processing distributed databases Spatial databases distributed computing Dynamic programming Data mining Data engineering Knowledge engineering Computer industry

来源：评论

学校读者我要写书评

暂无评论

COMPASS: an image retrieval system for distributed databases

COMPASS: an image retrieval system for distributed databases

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： R. Brunelli O. Mich ITC IRST Trento Italy

A currently relevant research field in information sciences is the management of non-traditional distributed multimedia databases. Three related key issues are achieving an effective content-based query-by-example retrieval, a fast response time and adapting image comparison strategies to user needs. This paper presents COMPASS, a distributed image retrieval system which provides novel solutions to these key issues. Statistical methods are used to quantify image descriptor effectiveness, to simplify user queries and to select an image comparison strategy which optimizes the search speed while preserving answer quality.

关键词： Information retrieval Image retrieval distributed databases Image databases Content based retrieval Image analysis Multimedia databases Delay Statistical analysis Optimization methods

来源：评论

学校读者我要写书评

暂无评论

distributed AEC databases FOR COLLABORATIVE DESIGN

引用

ENGINEERING WITH COMPUTERS 1994年第3期10卷 140-154页

作者： TIWARI, S HOWARD, HC 1. Department of Civil Engineering Stanford University 94305-4020 Stanford California USA

The Architecture, Engineering and Construction (AEC) design process for a facility involves participation of many design specialists. These participants are architects, engineers (structural, mechanical and electrical) and contractors, who may be independent design professionals or design teams within an organization. From the viewpoint of information processing, two characteristic features distinguish the AEC design process from many other design domains. Firstly, there is a massive volume of design data involved in the design of each of its component specialties. Secondly, the specialization of the disciplines themselves warrant substantial autonomy. For design automation, this autonomy should be realized without sacrificing the collaborative nature of the multidisciplinary AEC design process. We propose autonomous AEC databases to deal with the first issue, and a global constraint maintenance mechanism for the second. Autonomous design databases can support the existing local applications in architectural, structural and mechanical engineering, and construction domains. However, a set of inter-disciplinary constraints needs to be enforced to ensure spatial and functional consistency of the design. A global constraint checking mechanism frees designers from the burden of keeping track of various design changes that may result in cross-functional conflicts. In this paper, we discuss the relevant issues for constraint management on distributed AEC databases. Although specific AEC examples will be used, the presentation is general enough to be applicable to other design domains, such as VLSI and manufacturing.

关键词： COLLABORATIVE DESIGN distributed databases INTERDISCIPLINARY CONSTRAINTS CONSTRAINT LANGUAGE CONSTRAINT GRAMMAR CONSTRAINT COMPILER

来源：评论

学校读者我要写书评

暂无评论

Implementation of a virtual time synchronizer for distributed databases

Implementation of a virtual time synchronizer for distribute...

引用

International Symposium on Parallel Processing

作者： A. Boukerche S.K. Das A. Datta T.E. LeMaster Department of Computer Science University of North Texas Denton TX USA Department of Computer Science University of Nevada Las Vegas NV USA

The availability of high speed networks and improved microprocessor performance have made it possible to build inexpensive cluster of workstations as an appealing platform for parallel and distributed computing. In this paper, we study the performance of a distributed database system synchronized by virtual time (VT) mechanism by experimenting on a LAN-connected collection of 12 Sun-SPARCS workstations. Our experimental results demonstrate that the VT synchronization protocol is a viable concurrency control method, and it yields about 25-30% reduction in the response time, when compared with a widely used, multiversion (MV) concurrency control scheme based on timestamps order. The reason for comparing with the MV approach is that both virtual time and multiversion protocols are based upon the concept of timestamps, and attain high performance by using multiple version of data objects.

关键词： distributed databases Database systems Protocols Workstations Concurrency control Computer science distributed computing Object oriented modeling Concurrent computing System recovery

来源：评论

学校读者我要写书评

暂无评论

A Privacy-Preserving Mining Algorithm of Association Rules in distributed databases

A Privacy-Preserving Mining Algorithm of Association Rules i...

引用

International Multi-Symposiums on Computer and Computational Sciences (IMSCCS)

作者： Jie Liu Xiufeng Piao Shaobin Huang Harbin Engineering of Technology Harbin China

Association rules mining is one of the most important and fundamental problems in data mining. Recently, in need of security, more and more people are studying privacy- preserving association rules mining in distributed database. This paper addresses a secure mining algorithm of association rules, which builds a globe hash table to prune item-sets and incorporate cryptographic techniques to minimize the information shared

关键词： Data mining Association rules distributed databases Itemsets Cryptography Transaction databases Data engineering Data security Information security Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

An efficient incremental maintenance for association rules mining based on distributed databases

An efficient incremental maintenance for association rules m...

引用

International Conference on Computer Science and Network Technology (ICCSNT)

作者： Mahmoud Darwish Rania Elgohery Nagwa Badr Hossam Faheem Information Systems Department Ain Shams University Cairo Egypt Computer Systems Department Ain Shams University Cairo Egypt

Data Mining helps to reveal very important patterns and associations in large databases. Discovering these associations is very important to decision makers. Many organizations have multiple distributed databases and it is important to discover and maintain its association rule. Any update in the database requires starting the whole mining process again to generate new rules. This requires rescanning the whole database to maintain rules. This paper presents an efficient approach to reduce the time of incremental mining for association rules in distributed databases. The proposed approach is Apriori based distributed formulation on message passing interface. It uses the concept of pre large concept to help in reducing the cost of incremental mining. Experiments prove that our proposed incremental approach is much efficient than existing approaches. We present comparative analysis between the proposed approach and existing approach.

关键词： Itemsets Association rules distributed databases Message passing Maintenance engineering

来源：评论

学校读者我要写书评

暂无评论

Investigating evolutionary approaches for self-adaptation in large distributed databases

Investigating evolutionary approaches for self-adaptation in...

引用

IEEE International Conference on Evolutionary Computation

作者： M.J. Oates D. Corne R. Loader Department of Computer Science University of Reading UK

As the size of typical industrial strength databases continues to rise, particularly in the arena of the Internet and multimedia servers, the issue of managing data distribution over clusters or 'farms' to overcome performance and scalability issues is becoming of paramount importance. The general objective is to manage a self-adapting distributed database so as to reliably and consistently provide near optimal performance as perceived by client applications. Such a management system must ultimately be capable of operating over a range of time varying usage profiles and fault scenarios, incorporate considerations for multiple updates and maintenance operations, and be capable of being scaled in a practical fashion to ever larger sized networks and databases. This paper investigates evolutionary computation techniques, comparing a genetic algorithm, simulated annealing, and hillclimbing on a test problem in this field. Major differential algorithm performance is found across two different fitness criteria. Preliminary conclusions are that a genetic algorithm approach seems superior to hillclimbing or annealing when the more realistic (from a quality of service viewpoint) objective function is in force. Further, the genetic algorithm approach displays regions of adequate robustness to parameter variation, which is also critical from a maintained quality of service viewpoint.

关键词： Genetic algorithms Multimedia databases Quality of service Internet Web server Scalability distributed databases Computer network management Time varying systems Maintenance

来源：评论

学校读者我要写书评

暂无评论

Enhanced ant clustering algorithm (EACA) for distributed databases

Enhanced ant clustering algorithm (EACA) for distributed dat...

引用

International Conference on Computing and Networking Technology (ICCNT)

作者： K. Sumangala Department of Computer Science Kongunadu Arts and Science College Coimbatore TamilNadu

This paper presents an enhanced version of the Probabilistic Ant based Clustering Algorithm for distributed databases (PACE). The most important feature of this algorithm is to introduce ant based algorithm for inter ... 详细信息

ISBN: (纸本)9781479939275

关键词： Clustering algorithms distributed databases Algorithm design and analysis Iris recognition Sorting Probabilistic logic

来源：评论

学校读者我要写书评

暂无评论

An Efficient Association Rule Mining Algorithm In distributed databases

An Efficient Association Rule Mining Algorithm In Distribute...

引用

International Workshop on Knowledge Discovery and Data Mining (WKDD)

作者： Wu Jian Li Xing Ming School of Communication and Information Engineering University of Electronic Science and Technology Chengdu China

This paper describes the alarm correlation in communication networks based on data mining. A direct application of sequential algorithms to distributed databases is not effective, because it requires a large amount of communication overhead. In our study, an efficient algorithm, EDMA, is proposed. It minimizes the number of candidate sets and exchange messages by local and global pruning. In local sites, it runs the application based on the improved algorithm-CMatrix, which is used to calculate local support counts. By numbering the global frequent itemsets generated at the end of k-th iteration from 1 to m, the algorithm codes every candidate (k+l)-itemset into a pair of those number formed as-(x,y) to compress the context transmitted and query corresponding support counts in CMatrix. Our solution also reduces the size of average transactions and datasets that leads to reduction of scan time. The performance study shows that EDMA has superior running efficiency, lower communication cost and stronger scalability than direct application of a sequential algorithm in distributed databases.

关键词： Association rules Data mining distributed databases Itemsets Costs Partitioning algorithms Data engineering Knowledge engineering Paper technology Communication networks

来源：评论

学校读者我要写书评

暂无评论

Query optimization using clustering and Genetic Algorithm for distributed databases

Query optimization using clustering and Genetic Algorithm fo...

引用

International Conference on Computer Communication and Informatics (ICCCI)

作者： S. Venkata Lakshmi Valli Kumari Vatsavayi GITAM University Visakhapatnam Andhra Pradesh IN Andhra University Visakhapatnam Andhra Pradesh IN

ISBN: (纸本)9781467366816

Query Optimization is principally a multifaceted exploration job that searches for best plan amongst the semantically equal plans that are obtained from any given query. The execution of any processing datasets essentially depends on the capability of query optimization procedure to acquire competent query processing approaches. A distributed Database System (DDS) is a group of autonomous cooperating integrated procedure. Query at a specified place may necessitate information from distant places in a distributed Environment. In query optimization, the cost is accompanied by every query execution plan. Cost is the summation of native cost that is I/O cost, CPU cost at every location and cost of transmitting information amongst locations. The key issue of a Query Optimization in a distributed Database System is to obtain an effective query strategy with an efficient accuracy and minimum response time or cost to execute the given query. In this paper a novel methodology is suggested that selected the best query plan as to execute the given query employing Genetic Algorithm Strategy for distributed databases and a Clustering Approach within the databases so as to execute the query plan. Genetic Algorithms are extensively employed and acceptable methods for very challenging optimization problems. This proposed technique gives efficient performance in different environment. The Experimental analysis of the proposed methodology is carried out on 100 different queries distributed over 20 different sites having 8 relations in each query. This is compared with the DB2 distributed optimizers and achieved an increased reliability and high performance with respect to the optimization cost and accuracy for the queries in the distributed databases.

关键词： Query processing Genetic algorithms Optimization distributed databases Biological cells Genetics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：