Ninth International Conference on Digital Information Management (ICDIM 2014)最新文献_第2页

Towards the automation of XML data warehouse logical design 实现XML数据仓库逻辑设计的自动化

Ninth International Conference on Digital Information Management (ICDIM 2014) Pub Date : 2014-12-18 DOI: 10.1109/ICDIM.2014.6991422

Zoubir Ouaret, Omar Boussaïd, R. Chalal

{"title":"Towards the automation of XML data warehouse logical design","authors":"Zoubir Ouaret, Omar Boussaïd, R. Chalal","doi":"10.1109/ICDIM.2014.6991422","DOIUrl":"https://doi.org/10.1109/ICDIM.2014.6991422","url":null,"abstract":"Over the past few years XML has rapidly become a widely accepted data format for information interchange and representation of semi-structured data. As a result, huge amounts of interesting data are generated and distributed on the Web, prompting the need of new and automated approaches to store, organize and analyze such data. Data warehouses systems provide an efficient tool and integrated repository with a high level of consolidation and a multi-dimensional view of the data. Several studies address the issue for designing a conceptual and logical schema of XML Data Warehouses. Nevertheless, these approaches focus only on identifying multidimensional concepts in a semi-automatic fashion. In this paper we propose an automatic approach for designing the logical schema for a data mart starting from the XML schema describing XML sources using UML and QVT transformation language. Our focus is not only on automating an XML Data Warehouse design, but also on providing a simplification process and a set of rules that applies successive transformations to create the star schema which is the predominant logical multidimensional scheme. Finally, we discuss implementation issues and we present a graphical tool to help designers and engineers design without technical expertise in multi-dimensional data modeling.","PeriodicalId":407225,"journal":{"name":"Ninth International Conference on Digital Information Management (ICDIM 2014)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123346263","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Determining parameters for efficient retrieval in index structures for hybrid data spaces 确定在混合数据空间的索引结构中有效检索的参数

Ninth International Conference on Digital Information Management (ICDIM 2014) Pub Date : 2014-12-18 DOI: 10.1109/ICDIM.2014.6991402

Carsten Kropf

引用次数: 1

Universal database access layer to facilitate query 通用数据库访问层，方便查询

Ninth International Conference on Digital Information Management (ICDIM 2014) Pub Date : 2014-12-18 DOI: 10.1109/ICDIM.2014.6991401

M. Amin, R. Rahman

引用次数: 4

An efficient algorithm for density-balanced partitioning in distributed pagerank 分布式网页排名中密度均衡分区的一种有效算法

Ninth International Conference on Digital Information Management (ICDIM 2014) Pub Date : 2014-12-18 DOI: 10.1109/ICDIM.2014.6991418

S. Sangamuang, P. Boonma, J. Natwichai

{"title":"An efficient algorithm for density-balanced partitioning in distributed pagerank","authors":"S. Sangamuang, P. Boonma, J. Natwichai","doi":"10.1109/ICDIM.2014.6991418","DOIUrl":"https://doi.org/10.1109/ICDIM.2014.6991418","url":null,"abstract":"Google's PageRank is the most notable approach for web search ranking. In general, web pages are represented by web-link graph; a web-page is represented by a node, and a link between two pages is represented by an edge. In particular, it is not efficient to perform PageRank of a large web-link graph in a single computer. Distributed systems, such as P2P, are viable choices to address such limitation. In P2P-based PageRank, each computational peer contains a partial web-link graph, i.e., a sub-graph of the global web-link graph, and its PageRank is computed locally. The convergence time of a PageRank calculation is affected by the web-link graph density, i.e., the ratio of the number of edges to the number of nodes, such that if a web-link graph has high density, it will take longer time to converge. As the execution time to compute the P2P-based web ranking is influenced by the execution time of the slowest peer to compute the local ranking, the density-balanced local web-link graph partitioning can be highly desirable. This paper addresses a density-balanced partitioning problem and proposes an efficient algorithm for the problem. The experiment results show that the proposed algorithm can effectively partition graph into density-balanced sub with an acceptable cost.","PeriodicalId":407225,"journal":{"name":"Ninth International Conference on Digital Information Management (ICDIM 2014)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126372615","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Association rules: Normalizing the lift 关联规则:使升降机正常化

Ninth International Conference on Digital Information Management (ICDIM 2014) Pub Date : 2014-12-18 DOI: 10.1109/ICDIM.2014.6991393

Desmond Lobo

引用次数: 4

A novel feature selection by clustering coefficients of variations 一种基于变异系数聚类的特征选择方法

Ninth International Conference on Digital Information Management (ICDIM 2014) Pub Date : 2014-12-18 DOI: 10.1109/ICDIM.2014.6991429

S. Fong, Justin Liang, R. Wong, M. Ghanavati

引用次数: 26

Analyzing national e-Government interoperability frameworks: A case of Thailand 分析国家电子政务互操作性框架:以泰国为例

Ninth International Conference on Digital Information Management (ICDIM 2014) Pub Date : 2014-12-18 DOI: 10.1109/ICDIM.2014.6991416

Sasithorn Suchaiya, Somnuk Keretho

引用次数: 7

Project resource allocation optimization using search based software engineering — A framework 基于搜索的项目资源分配优化软件工程框架

Ninth International Conference on Digital Information Management (ICDIM 2014) Pub Date : 2014-12-18 DOI: 10.1109/ICDIM.2014.6991431

Nazia Bibi, A. Ahsan, Zeeshan Anwar

{"title":"Project resource allocation optimization using search based software engineering — A framework","authors":"Nazia Bibi, A. Ahsan, Zeeshan Anwar","doi":"10.1109/ICDIM.2014.6991431","DOIUrl":"https://doi.org/10.1109/ICDIM.2014.6991431","url":null,"abstract":"Human Resource Management is an important area of project management. The concept of Human Resource Allocation is not new and it can also be used for resource allocation to software projects. Software projects are more critical as compared to projects of other disciplines because success of software projects dependents on human resources. In software projects, Project Manager (PM) allocates resources and level resources using Resource Leveling techniques which are already implemented in various project management software. But, Resource Leveling is a resource smoothing technique not an optimization technique neither it ensures optimized resource allocation. Furthermore, Project duration and cost may increase after resource leveling. Therefore, resource leveling is not always a reliable method for resource allocation optimization. Exact solution of resource optimization problem cannot be determined because resource optimization is a NP-Hard problem. To solve resource optimization problems Search Based Software Engineering (SBSE) is used in various studies. However, in existing SBSE algorithms implementation for resource allocation optimization many objectives are not considered. Resource allocation optimization is a multi-objective optimization problem and many important factors like activity criticality, resource skills, activity precedence, skill required to perform activities must be addressed. Our research fills this gap and uses multiple objectives for resource allocation optimization which are 1: increase resource utilization, 2: decrease project duration and 3: decrease project cost. A framework and mathematical model for the implementation of resource allocation optimization is also proposed.","PeriodicalId":407225,"journal":{"name":"Ninth International Conference on Digital Information Management (ICDIM 2014)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127747727","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 9

Spatial access method for urban geospatial database management: An efficient approach of 3D vector data clustering technique 城市地理空间数据库管理的空间访问方法:三维矢量数据聚类技术的一种有效途径

Ninth International Conference on Digital Information Management (ICDIM 2014) Pub Date : 2014-12-18 DOI: 10.1109/ICDIM.2014.6991400

S. Azri, U. Ujang, A. Abdul-Rahman, F. Anton, D. Mioc

{"title":"Spatial access method for urban geospatial database management: An efficient approach of 3D vector data clustering technique","authors":"S. Azri, U. Ujang, A. Abdul-Rahman, F. Anton, D. Mioc","doi":"10.1109/ICDIM.2014.6991400","DOIUrl":"https://doi.org/10.1109/ICDIM.2014.6991400","url":null,"abstract":"In the last few years, 3D urban data and its information are rapidly increased due to the growth of urban area and urbanization phenomenon. These datasets are then maintain and manage in 3D spatial database system. However, performance deterioration is likely to happen due to the massiveness of 3D datasets. As a solution, 3D spatial index structure is used as a booster to increase the performance of data retrieval. In commercial database, commonly and widely used index structure for 3D spatial database is 3D R-Tree. This is due to its simplicity and promising method in handling spatial data. However, 3D R-Tree produces serious overlapping among nodes. The overlapping factor is important for an efficient 3D R-Tree to avoid replicated data entry in a different node. Thus, an efficient and reliable method is required to reduce the overlapping nodes in 3D R-Tree nodes. In this paper, we proposed a 3D geospatial data clustering to be used in the construction of 3D R-Tree and respectively could reduce the overlapping among nodes. The proposed method is tested on 3D urban dataset for the application of urban infill development. By using several cases of data updating operations such as building infill, building demolition and building modification, the proposed method indicates that the percentage of overlapping coverage among nodes is reduced compared with other existing approaches.","PeriodicalId":407225,"journal":{"name":"Ninth International Conference on Digital Information Management (ICDIM 2014)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126917891","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 15

Artificial neural network-based time series analysis forecasting for the amount of solid waste in Bangkok 基于人工神经网络的时间序列分析预测曼谷城市固体垃圾量

Ninth International Conference on Digital Information Management (ICDIM 2014) Pub Date : 2014-12-18 DOI: 10.1109/ICDIM.2014.6991427

M. Sodanil, Paiboon Chatthong

引用次数: 24