基于蚁群理论的数据源和查询处理站点的自主排序和表征

Eliana Valenzuela Andrade, Manuel Rodiguez-Martinez
{"title":"基于蚁群理论的数据源和查询处理站点的自主排序和表征","authors":"Eliana Valenzuela Andrade, Manuel Rodiguez-Martinez","doi":"10.1109/AMS.2009.71","DOIUrl":null,"url":null,"abstract":"This paper presents a novel approach to the problem of discovering and ranking the characteristics of the data sources and query processing sites in a distributed database system. We model the network as a graph with nodes representing data sources and query processing sites, some of which might be replicated.We introduce a heuristic technique inspired in Ant Colony Theory to dynamically discover,assess and catalog each data source or query-processing site. Our goal is to find possible paths to access the computational resources or data provided by the highest quality sites and define the quality of this sites and data sources. The concept of quality could be defined  in terms of performance, freshness, completeness or other metrics. We describe a simulation of the system using Java CSIM and also a preliminary performance and freshness studies designed to analyze the quality of paths found by the Ant Colony algorithm and the accurate of the freshness estimators. These experiments show  that our approach  is promissory and could do the job than we expect offering the information that the system needs to optimize a query request in a middleware system.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Autonomic Ranking  and Characterization of Data Sources and Query Processing Sites Using Ant Colony Theory\",\"authors\":\"Eliana Valenzuela Andrade, Manuel Rodiguez-Martinez\",\"doi\":\"10.1109/AMS.2009.71\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a novel approach to the problem of discovering and ranking the characteristics of the data sources and query processing sites in a distributed database system. We model the network as a graph with nodes representing data sources and query processing sites, some of which might be replicated.We introduce a heuristic technique inspired in Ant Colony Theory to dynamically discover,assess and catalog each data source or query-processing site. Our goal is to find possible paths to access the computational resources or data provided by the highest quality sites and define the quality of this sites and data sources. The concept of quality could be defined  in terms of performance, freshness, completeness or other metrics. We describe a simulation of the system using Java CSIM and also a preliminary performance and freshness studies designed to analyze the quality of paths found by the Ant Colony algorithm and the accurate of the freshness estimators. These experiments show  that our approach  is promissory and could do the job than we expect offering the information that the system needs to optimize a query request in a middleware system.\",\"PeriodicalId\":6461,\"journal\":{\"name\":\"2009 Third Asia International Conference on Modelling & Simulation\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-05-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Third Asia International Conference on Modelling & Simulation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AMS.2009.71\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Third Asia International Conference on Modelling & Simulation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AMS.2009.71","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

针对分布式数据库系统中数据源和查询处理站点的特征发现和排序问题,提出了一种新的方法。我们将网络建模为一个图,其中节点表示数据源和查询处理站点,其中一些可能被复制。我们引入了一种启发蚁群理论的启发式技术来动态地发现、评估和编目每个数据源或查询处理站点。我们的目标是找到访问最高质量站点提供的计算资源或数据的可能路径,并定义这些站点和数据源的质量。质量的概念可以根据性能、新鲜度、完整性或其他指标来定义。我们使用Java CSIM对该系统进行了仿真,并进行了初步的性能和新鲜度研究,旨在分析蚁群算法找到的路径的质量和新鲜度估计器的准确性。这些实验表明,我们的方法是有承诺的,并且可以比我们期望的工作提供系统需要的信息来优化中间件系统中的查询请求。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Autonomic Ranking  and Characterization of Data Sources and Query Processing Sites Using Ant Colony Theory
This paper presents a novel approach to the problem of discovering and ranking the characteristics of the data sources and query processing sites in a distributed database system. We model the network as a graph with nodes representing data sources and query processing sites, some of which might be replicated.We introduce a heuristic technique inspired in Ant Colony Theory to dynamically discover,assess and catalog each data source or query-processing site. Our goal is to find possible paths to access the computational resources or data provided by the highest quality sites and define the quality of this sites and data sources. The concept of quality could be defined  in terms of performance, freshness, completeness or other metrics. We describe a simulation of the system using Java CSIM and also a preliminary performance and freshness studies designed to analyze the quality of paths found by the Ant Colony algorithm and the accurate of the freshness estimators. These experiments show  that our approach  is promissory and could do the job than we expect offering the information that the system needs to optimize a query request in a middleware system.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信