Pub Date : 2016-07-13DOI: 10.1109/CSIT.2016.7549467
Mohammed N. Alandoli, M. Shehab, M. Al-Ayyoub, Y. Jararweh, Mohammad Al-Smadi
One of the important features of Social Networks (SNs) is community structure detection. Several methods have been proposed to address this problem. One of the interesting methods is based on the famous Fuzzy C-Means (FCM) clustering algorithm. This method consists of three phases: spectral mapping, FCM clustering and modularity computation. Despite being very effective, this method is actually inefficient to deal with large-scale networks. A parallel implementation using GPUs is one of the feasible solutions to address this problem. Hence, this research presents a parallel implementation of FCM and modularity components of the algorithms. The implementation follows the hybrid CPU-GPU approach. We study the many factors affecting the performance speedups, such as the number of dimensions/features and the network size.
{"title":"Using GPUs to speed-up FCM-based community detection in Social Networks","authors":"Mohammed N. Alandoli, M. Shehab, M. Al-Ayyoub, Y. Jararweh, Mohammad Al-Smadi","doi":"10.1109/CSIT.2016.7549467","DOIUrl":"https://doi.org/10.1109/CSIT.2016.7549467","url":null,"abstract":"One of the important features of Social Networks (SNs) is community structure detection. Several methods have been proposed to address this problem. One of the interesting methods is based on the famous Fuzzy C-Means (FCM) clustering algorithm. This method consists of three phases: spectral mapping, FCM clustering and modularity computation. Despite being very effective, this method is actually inefficient to deal with large-scale networks. A parallel implementation using GPUs is one of the feasible solutions to address this problem. Hence, this research presents a parallel implementation of FCM and modularity components of the algorithms. The implementation follows the hybrid CPU-GPU approach. We study the many factors affecting the performance speedups, such as the number of dimensions/features and the network size.","PeriodicalId":210905,"journal":{"name":"2016 7th International Conference on Computer Science and Information Technology (CSIT)","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128802132","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}
Pub Date : 2016-07-13DOI: 10.1109/CSIT.2016.7549483
Norzilah Musa, S. Z. Abidin, N. Omar
In the collaborative working environment, users in a group activity are formally communicated to each other in the public workspace to collaboratively develop information artefact. However, complex tasks activities required dynamic and creative solutions that need additional spaces for private and informal interactions among group members. Hence, one group project may consist of various sub-group activities with different communication strategies based on the needs of the task. Currently, the existing systems do not provide the mechanism for users to define their own sub-group communication dimensions with preferable users. To this end, we propose an approach to enable the propagation communication dimension that associated with sub-group activity in the collaborative workspace. We formulate the multi-dimensional communication model based on user-to-user and user-to-group relationships that facilitate users in controlling the communication flow. In order to justify that our approach is applicable, we describe the possible user relations in several abstract scene scenario.
{"title":"Managing sub-group interactions and communication in group collaboration activities","authors":"Norzilah Musa, S. Z. Abidin, N. Omar","doi":"10.1109/CSIT.2016.7549483","DOIUrl":"https://doi.org/10.1109/CSIT.2016.7549483","url":null,"abstract":"In the collaborative working environment, users in a group activity are formally communicated to each other in the public workspace to collaboratively develop information artefact. However, complex tasks activities required dynamic and creative solutions that need additional spaces for private and informal interactions among group members. Hence, one group project may consist of various sub-group activities with different communication strategies based on the needs of the task. Currently, the existing systems do not provide the mechanism for users to define their own sub-group communication dimensions with preferable users. To this end, we propose an approach to enable the propagation communication dimension that associated with sub-group activity in the collaborative workspace. We formulate the multi-dimensional communication model based on user-to-user and user-to-group relationships that facilitate users in controlling the communication flow. In order to justify that our approach is applicable, we describe the possible user relations in several abstract scene scenario.","PeriodicalId":210905,"journal":{"name":"2016 7th International Conference on Computer Science and Information Technology (CSIT)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128495371","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}
Pub Date : 2016-07-13DOI: 10.1109/CSIT.2016.7549464
L. Abualigah, A. Khader, M. Al-Betar
Text documents clustering is a popular unsupervised text mining tool. It is used for partitioning a collection of text documents into similar clusters based on the distance or similarity measure as decided by an objective function. Text clustering algorithm often makes prior assumptions to satisfy objective function, which is optimized either through traditional techniques or meta-heuristic techniques. In text clustering techniques, the right decision for any document distribution is done using an objective function. Normally, clustering algorithms perform poorly when the configuration of the well-formulated objective function is not sound and complete. Therefore, we proposed multi-objectives-based method namely, combine distance and similarity measure for improving the text clustering technique. Multi-objectives text clustering method is combined with two evaluating criteria which emerge as a robust alternative in several situations. In particular, the multi-objective function in the text clustering domain is not a popular, and it is a core issue that affects the performance of the text clustering technique. The performance of multi-objectives function is investigated using the k-mean text clustering technique. The experiments were conducted using seven standard text datasets. The results showed that the proposed multi-objectives based method outperforms the other measures in term of the performance of the text clustering, evaluated by using two common clustering measures, namely, Accuracy and F-measure.
{"title":"Multi-objectives-based text clustering technique using K-mean algorithm","authors":"L. Abualigah, A. Khader, M. Al-Betar","doi":"10.1109/CSIT.2016.7549464","DOIUrl":"https://doi.org/10.1109/CSIT.2016.7549464","url":null,"abstract":"Text documents clustering is a popular unsupervised text mining tool. It is used for partitioning a collection of text documents into similar clusters based on the distance or similarity measure as decided by an objective function. Text clustering algorithm often makes prior assumptions to satisfy objective function, which is optimized either through traditional techniques or meta-heuristic techniques. In text clustering techniques, the right decision for any document distribution is done using an objective function. Normally, clustering algorithms perform poorly when the configuration of the well-formulated objective function is not sound and complete. Therefore, we proposed multi-objectives-based method namely, combine distance and similarity measure for improving the text clustering technique. Multi-objectives text clustering method is combined with two evaluating criteria which emerge as a robust alternative in several situations. In particular, the multi-objective function in the text clustering domain is not a popular, and it is a core issue that affects the performance of the text clustering technique. The performance of multi-objectives function is investigated using the k-mean text clustering technique. The experiments were conducted using seven standard text datasets. The results showed that the proposed multi-objectives based method outperforms the other measures in term of the performance of the text clustering, evaluated by using two common clustering measures, namely, Accuracy and F-measure.","PeriodicalId":210905,"journal":{"name":"2016 7th International Conference on Computer Science and Information Technology (CSIT)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126343476","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}
Pub Date : 2016-07-13DOI: 10.1109/CSIT.2016.7549462
Mustafa Al-Rubaye, H. Salameh, Y. Jararweh
In this paper, we propose a multi-layer multicast routing protocol for multi-hop mobile ad hoc cognitive radio (CR) networks. The proposed protocol employs a probabilistic approach in performing the channel assignment and path selection process based on the concept of minimum spanning tree (MST). Our protocol accounts for the unique features of CR operating environment. Simulations experiments are conducted to investigate the effectiveness of the our protocol under various network conditions in terms of network throughput and packet delivery rate. Compared with reference CR multicast protocols, simulations results show that our multi-layer multicast protocol signif cantly improves network performance.
{"title":"Minimum spanning tree-based multicast routing protocol for dynamic spectrum access networks: A multi-layer probabilistic approach","authors":"Mustafa Al-Rubaye, H. Salameh, Y. Jararweh","doi":"10.1109/CSIT.2016.7549462","DOIUrl":"https://doi.org/10.1109/CSIT.2016.7549462","url":null,"abstract":"In this paper, we propose a multi-layer multicast routing protocol for multi-hop mobile ad hoc cognitive radio (CR) networks. The proposed protocol employs a probabilistic approach in performing the channel assignment and path selection process based on the concept of minimum spanning tree (MST). Our protocol accounts for the unique features of CR operating environment. Simulations experiments are conducted to investigate the effectiveness of the our protocol under various network conditions in terms of network throughput and packet delivery rate. Compared with reference CR multicast protocols, simulations results show that our multi-layer multicast protocol signif cantly improves network performance.","PeriodicalId":210905,"journal":{"name":"2016 7th International Conference on Computer Science and Information Technology (CSIT)","volume":"140 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129652021","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}
Pub Date : 2016-07-13DOI: 10.1109/CSIT.2016.7549451
A. Al-Badarneh, Hassan M. Najadat, Majd Al-Soud, Rasha Mosaid
Lately, the large increasing in data amount results in compound and large data-sets that caused the appearance of “Big Data” concept which gained the attention of industrial organizations as well as academic communities. Big data APIs that need large memory can benefit from Phoenix MapReduce implementation for shared-memory machines, instead of large, distributed clusters of computers. This paper evaluates the design and the prototype of Phoenix, Phoenix performance, as well as Phoenix limitations. This paper also suggests some new approaches to get over of some Phoenix limitation and enhance its performance on large-scale shared memory. The major contribution of this work is finding new approaches that get over the <;key, value> pairs limitation in phoenix framework using hash tables with B+Trees and get over the collisions problem of hash tables.
{"title":"Phoenix: A MapReduce implementation with new enhancements","authors":"A. Al-Badarneh, Hassan M. Najadat, Majd Al-Soud, Rasha Mosaid","doi":"10.1109/CSIT.2016.7549451","DOIUrl":"https://doi.org/10.1109/CSIT.2016.7549451","url":null,"abstract":"Lately, the large increasing in data amount results in compound and large data-sets that caused the appearance of “Big Data” concept which gained the attention of industrial organizations as well as academic communities. Big data APIs that need large memory can benefit from Phoenix MapReduce implementation for shared-memory machines, instead of large, distributed clusters of computers. This paper evaluates the design and the prototype of Phoenix, Phoenix performance, as well as Phoenix limitations. This paper also suggests some new approaches to get over of some Phoenix limitation and enhance its performance on large-scale shared memory. The major contribution of this work is finding new approaches that get over the <;key, value> pairs limitation in phoenix framework using hash tables with B+Trees and get over the collisions problem of hash tables.","PeriodicalId":210905,"journal":{"name":"2016 7th International Conference on Computer Science and Information Technology (CSIT)","volume":"424 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127603351","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}
Pub Date : 2016-07-13DOI: 10.1109/CSIT.2016.7549444
Lina A. Abuwardih, Wa'ed Shatnawi, Ahmed Aleroud
Healthcare data is considered very significant to researchers in this field. Such information must be published with methods that keep the identity of patients hidden especially when dealing with sensitive information. Publishing such information makes it more vulnerable to attackers. As such, many techniques were proposed to preserve the privacy of healthcare data. In this paper, we illustrated a survey for the models and techniques that are used for publishing data about patients.
{"title":"Privacy preserving data mining on published data in healthcare: A survey","authors":"Lina A. Abuwardih, Wa'ed Shatnawi, Ahmed Aleroud","doi":"10.1109/CSIT.2016.7549444","DOIUrl":"https://doi.org/10.1109/CSIT.2016.7549444","url":null,"abstract":"Healthcare data is considered very significant to researchers in this field. Such information must be published with methods that keep the identity of patients hidden especially when dealing with sensitive information. Publishing such information makes it more vulnerable to attackers. As such, many techniques were proposed to preserve the privacy of healthcare data. In this paper, we illustrated a survey for the models and techniques that are used for publishing data about patients.","PeriodicalId":210905,"journal":{"name":"2016 7th International Conference on Computer Science and Information Technology (CSIT)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114516221","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}
Pub Date : 2016-07-13DOI: 10.1109/CSIT.2016.7549475
Hani Bani Salameh, Ayat Ahmad, A. Aljammal
Background: Software is an important asset for organizations and development teams. It must evolve over time in order to meet different changes in its environment, satisfy the developers' needs, and adapt to new requirements. Software developers and team members face difficulties tracking the changes others made to their software. Software visualization is one of the effective techniques that help stakeholders to better understand how software evolves, and which parts of the software are most affected by the change. Many visualization tools and techniques have been introduced by researchers and organizations to facilitate such understanding. Method: This article presents a systematic literature review (SLR) on software evolution visualization (SEV) tools. The SLR's main focus is to: (1) explore the main target of SEV, (2) analyze the classifications and taxonomies that are used to represent SEV tools, and (3) find out what are the main sources of information used to visualize software's evolution. Result: 29 papers were analyzed out of 55 papers. The result showed that SEV tools can be classified into five different groups: graph-based, notation-based, matrix-based, and metaphor-based and others. Graph-based are most popular while Notation-based are the least. SEVs focus can be either Artifact-centric visualization, Metric-centric visualization, Feature-centric visualization, or Architecture-centric visualization. The main source of information used to ex-tract information are the software repositories. Conclusion: This work can help developer, maintainer, researcher to get good knowledge about the state of software evolution and visualization as a whole.
{"title":"Software evolution visualization techniques and methods - a systematic review","authors":"Hani Bani Salameh, Ayat Ahmad, A. Aljammal","doi":"10.1109/CSIT.2016.7549475","DOIUrl":"https://doi.org/10.1109/CSIT.2016.7549475","url":null,"abstract":"Background: Software is an important asset for organizations and development teams. It must evolve over time in order to meet different changes in its environment, satisfy the developers' needs, and adapt to new requirements. Software developers and team members face difficulties tracking the changes others made to their software. Software visualization is one of the effective techniques that help stakeholders to better understand how software evolves, and which parts of the software are most affected by the change. Many visualization tools and techniques have been introduced by researchers and organizations to facilitate such understanding. Method: This article presents a systematic literature review (SLR) on software evolution visualization (SEV) tools. The SLR's main focus is to: (1) explore the main target of SEV, (2) analyze the classifications and taxonomies that are used to represent SEV tools, and (3) find out what are the main sources of information used to visualize software's evolution. Result: 29 papers were analyzed out of 55 papers. The result showed that SEV tools can be classified into five different groups: graph-based, notation-based, matrix-based, and metaphor-based and others. Graph-based are most popular while Notation-based are the least. SEVs focus can be either Artifact-centric visualization, Metric-centric visualization, Feature-centric visualization, or Architecture-centric visualization. The main source of information used to ex-tract information are the software repositories. Conclusion: This work can help developer, maintainer, researcher to get good knowledge about the state of software evolution and visualization as a whole.","PeriodicalId":210905,"journal":{"name":"2016 7th International Conference on Computer Science and Information Technology (CSIT)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123229632","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}
Pub Date : 2016-07-13DOI: 10.1109/CSIT.2016.7549470
Mehmed Taha Aras, Y. E. Selçuk
Patterns are techniques to improve design and enhance reusability. Design patterns are general solutions which are used for common problems in object oriented systems. Code and design smells are symptoms of weak design and development, problems that reside deep in code and reduce the quality of software. The antipattern concept is also introduced as poor solutions to solve recurring problems, even though developers think that they practice a design pattern. It is proven that antipatterns have negative effects on maintainability, flexibility and readability of object oriented software systems. In this research, we propose a metric and a rule based automated antipattern detection system for object oriented software. This system consists of three main mechanisms to detect an antipattern. These mechanisms are “Metric Analyzer”, “Static Code Analyzer” and “Filtering Mechanism”. We specified three antipatterns to analyze; namely Blob, Swiss Army Knife and Lava Flow. Thresholds that are used to detect antipatterns are determined considering six reference projects' results and averages of the analyzed project itself. Detection algorithms have been applied on a set of hand-crafted Java classes and accuracy percentages are measured according to the produced results.
模式是改进设计和增强可重用性的技术。设计模式是用于解决面向对象系统中常见问题的通用解决方案。代码和设计气味是设计和开发薄弱的症状，存在于代码深处的问题降低了软件的质量。反模式概念也是作为解决反复出现的问题的糟糕解决方案引入的，即使开发人员认为他们实践了设计模式。事实证明，反模式对面向对象软件系统的可维护性、灵活性和可读性有负面影响。在本研究中，我们提出了一种基于度量和规则的面向对象软件自动反模式检测系统。该系统由三种检测反模式的主要机制组成。这些机制是“度量分析器”、“静态代码分析器”和“过滤机制”。我们指定了三个要分析的反模式;即Blob, Swiss Army Knife和Lava Flow。用于检测反模式的阈值是根据六个参考项目的结果和所分析项目本身的平均值来确定的。检测算法已应用于一组手工制作的Java类，并根据生成的结果测量准确率百分比。
{"title":"Metric and rule based automated detection of antipatterns in object-oriented software systems","authors":"Mehmed Taha Aras, Y. E. Selçuk","doi":"10.1109/CSIT.2016.7549470","DOIUrl":"https://doi.org/10.1109/CSIT.2016.7549470","url":null,"abstract":"Patterns are techniques to improve design and enhance reusability. Design patterns are general solutions which are used for common problems in object oriented systems. Code and design smells are symptoms of weak design and development, problems that reside deep in code and reduce the quality of software. The antipattern concept is also introduced as poor solutions to solve recurring problems, even though developers think that they practice a design pattern. It is proven that antipatterns have negative effects on maintainability, flexibility and readability of object oriented software systems. In this research, we propose a metric and a rule based automated antipattern detection system for object oriented software. This system consists of three main mechanisms to detect an antipattern. These mechanisms are “Metric Analyzer”, “Static Code Analyzer” and “Filtering Mechanism”. We specified three antipatterns to analyze; namely Blob, Swiss Army Knife and Lava Flow. Thresholds that are used to detect antipatterns are determined considering six reference projects' results and averages of the analyzed project itself. Detection algorithms have been applied on a set of hand-crafted Java classes and accuracy percentages are measured according to the produced results.","PeriodicalId":210905,"journal":{"name":"2016 7th International Conference on Computer Science and Information Technology (CSIT)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115395477","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}
Pub Date : 2016-07-13DOI: 10.1109/CSIT.2016.7549466
M. Al-Jarrah
Mobile robot system will be an important asset in our future. Mobile robot not only has to execute predefined tasks programmed with, but also it must explore the unknown environment that might be pushed to work in. In this paper we propose, implement and test a new model for mobile robot environment using mono-vision system. This proposed system develops 3D environment model utilizing mono-vision system. The model is developed through capturing multiple shots from different locations. The 3D model describes the distance and the angle of objects with respect to the robot. Finally, the mobile robot will utilize this model to navigate its environment. This is achieved through projecting the 3D model into the motion floor and identifying the obstacles surrounding the robot. Then, the robot will avoid any object in its motion line. Most importantly, the model is updated continuously based on the changes in the environment and the location of the robot.
{"title":"Developing 3D model for mobile robot environment using mono-vision system","authors":"M. Al-Jarrah","doi":"10.1109/CSIT.2016.7549466","DOIUrl":"https://doi.org/10.1109/CSIT.2016.7549466","url":null,"abstract":"Mobile robot system will be an important asset in our future. Mobile robot not only has to execute predefined tasks programmed with, but also it must explore the unknown environment that might be pushed to work in. In this paper we propose, implement and test a new model for mobile robot environment using mono-vision system. This proposed system develops 3D environment model utilizing mono-vision system. The model is developed through capturing multiple shots from different locations. The 3D model describes the distance and the angle of objects with respect to the robot. Finally, the mobile robot will utilize this model to navigate its environment. This is achieved through projecting the 3D model into the motion floor and identifying the obstacles surrounding the robot. Then, the robot will avoid any object in its motion line. Most importantly, the model is updated continuously based on the changes in the environment and the location of the robot.","PeriodicalId":210905,"journal":{"name":"2016 7th International Conference on Computer Science and Information Technology (CSIT)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116736883","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}
Pub Date : 2016-07-13DOI: 10.1109/CSIT.2016.7549455
Ahmed Abd el Moneim Kamal, Yasser Omar, A. Ghalwash
Although the tendency towards a Semantic Web is increasing, the current Web is keen on more semantic data. There are several web application domains which need to present their data in the form of graphs to get information and knowledge to allow semantic web searching to deal with them. These domains can be for example geographic data, data in the area of bioinformatics, social networks or even corporate search engines. Most of these domains already store their data in relational database management systems which are not capable of being queried directly by semantic web applications. In this paper we will propose a semi-automated method to map the data from relational databases to RDF structures. This is true for both a single source database as well as different source databases. The results show a complexity of order n2 where n is the number of records processed, when it comes to the performance in creating the output from mapping the relational database to RDF files.
{"title":"Simultaneous mapping of multi RDB to RDF","authors":"Ahmed Abd el Moneim Kamal, Yasser Omar, A. Ghalwash","doi":"10.1109/CSIT.2016.7549455","DOIUrl":"https://doi.org/10.1109/CSIT.2016.7549455","url":null,"abstract":"Although the tendency towards a Semantic Web is increasing, the current Web is keen on more semantic data. There are several web application domains which need to present their data in the form of graphs to get information and knowledge to allow semantic web searching to deal with them. These domains can be for example geographic data, data in the area of bioinformatics, social networks or even corporate search engines. Most of these domains already store their data in relational database management systems which are not capable of being queried directly by semantic web applications. In this paper we will propose a semi-automated method to map the data from relational databases to RDF structures. This is true for both a single source database as well as different source databases. The results show a complexity of order n2 where n is the number of records processed, when it comes to the performance in creating the output from mapping the relational database to RDF files.","PeriodicalId":210905,"journal":{"name":"2016 7th International Conference on Computer Science and Information Technology (CSIT)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124205912","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：