The increasing popularity of XML has generated a lot of interest in query processing over graph-s... more The increasing popularity of XML has generated a lot of interest in query processing over graph-structured data. To support efficient evaluation of path expressions structured indexes have been proposed. However, most variants of structures indexes ignore inter- or intra-document references. They assume a tree-like structure of XML-documents. Extending these indexes to work with large XML graphs and to support intra-or inter-document links requires a lot of computing power for the creation process and a lot of space to store the indexes. Moreover, the efficient evaluation of ancestors-descendants queries over arbitrary graphs with long paths is a severe problem. In this paper, we propose a scalable path index that is based on the concept of 2-hop covers as introduced by Cohen el al. The proposed algo-rithm for index creation scales down the original graph size substantially. As a result a directed acyclic graph with a smaller number of nodes and edges will emerge. This reduces the n...
In many fields, complicated issues can now be solved with the help of Artificial Intelligence (AI... more In many fields, complicated issues can now be solved with the help of Artificial Intelligence (AI) and Machine Learning (ML). One of the more modern Metaheuristic (MH) algorithms used to tackle numerous issues in various fields is the Beluga Whale Optimization (BWO) method. However, BWO has a lack of diversity, which could lead to being trapped in local optimaand premature convergence. This study presents two stages for enhancing the fundamental BWO algorithm. The initial stage of BWO’s Opposition-Based Learning (OBL), also known as OBWO, helps to expedite the search process and enhance the learning methodology to choose a better generation of candidate solutions for the fundamental BWO. The second step, referred to as OBWOD, combines the Dynamic Candidate Solution (DCS) and OBWO based on the k-Nearest Neighbor (kNN) classifier to boost variety and improve the consistency of the selected solution by giving potential candidates a chance to solve the given problem with a high fitness ...
ABSTRACT Many schema labelling approaches have been designed to facilitate querying of XML docume... more ABSTRACT Many schema labelling approaches have been designed to facilitate querying of XML documents. The proposed algorithms are based on the fact that ancestor–descendant relationships among nodes can be quickly determined. Schema labelling is a family of technologies widely used in indexing tree, graph, or structured XML graph, in which a unique identifier is assigned to each node in the tree/graph. The generated identifier is then used in indexing as a reference to the actual node so that structural relationship among the nodes can be quickly captured. In this paper, we extend the prime number schema labelling algorithm for labelling DAG XML graph. Our main contribution is scaling down the original XML graph size substantially based on the Strongly Connected Component (SCC) principles. Labelling each node in DAG with an integer that is the arithmetical multiplication of the prime number associating with the node and its parent label. The schema does not depend on spanning tree. Thus, subsumption hierarchies represented in a DAG can be efficiently explored by checking the divisibility among the labels. Also, it inherits dynamic update ability and compact size features from its predecessors. Our theoretical analysis and the experimental results showed that the generated labelled schema is an efficient and a scalable one for processing reachability queries on large XML graphs.
International Journal of Web Information Systems, 2010
PurposeInformation retrieval (IR) and feedback in Extensible Markup Language (XML) are rather new... more PurposeInformation retrieval (IR) and feedback in Extensible Markup Language (XML) are rather new fields for researchers; natural questions arise, such as: how good are the feedback algorithms in XML IR? Can they be evaluated with standard evaluation tools? Even though some evaluation methods have been proposed in the literature it is still not clear yet which of them are applicable in the context of XML IR, and which metrics they can be combined with to assess the quality of XML retrieval algorithms that use feedback. This paper aims to elaborate on this.Design/methodology/approachThe efficient evaluation of relevance feedback (RF) algorithms for XML collection posed interesting challenges on the IR and database researchers. The system based on the keyword‐based queries whether on the main query or in the RF processing instead of the XPath and structure query languages which were more complex. For measuring the efficiency of the system, the paper used the extended RF algorithms (re...
International Journal of Web Information Systems, 2009
PurposeThe increasing popularity of XML has generated a lot of interest in query processing over ... more PurposeThe increasing popularity of XML has generated a lot of interest in query processing over graph‐structured data. To support efficient evaluation of path expressions structured indexes have been proposed. Extending the proposed indexes to work with large XML graphs and to support intra‐ or inter‐document links requires a lot of computing power for the creation process and a lot of space to store the indexes. Moreover, the efficient evaluation of ancestors‐descendants queries over arbitrary graphs with long paths is a severe problem. This paper aims to propose a scalable path index which is based on the concept of 2‐hop covers as introduced by Cohen et al.Design/methodology/approachThe problem of efficiently managing and querying XML documents poses interesting challenges on database research. The proposed algorithm for index creation scales down the original graph size substantially. As a result a directed acyclic graph with a smaller number of nodes and edges will emerge. Thi...
This review presents various perspectives on converting user keywords into a formal query. Withou... more This review presents various perspectives on converting user keywords into a formal query. Without understanding the dataset’s underlying structure, how can a user input a text-based query and then convert this text into semantic protocol and resource description framework query language (SPARQL) that deals with the resource description framework (RDF) knowledge base? The user may not know the structure and syntax of SPARQL, a formal query language and a sophisticated tool for the semantic web (SEW) and its vast and growing collection of interconnected open data repositories. As a result, this study examines various strategies for turning natural language into formal queries, their workings, and their results. In an Internet search engine from a single query, such as on Google, numerous matching documents are returned, with several related to the inquiry while others are not. Since a considerable percentage of the information retrieved is likely unrelated, sophisticated information ...
The continuous growth in the XML information repositories has been matched by increasing efforts ... more The continuous growth in the XML information repositories has been matched by increasing efforts in development of XML retrieval systems, in large parts aiming at supporting content-oriented XML retrieval. These systems exploit the available structural information, as market up in XML documents, in order to return documents components- the so called XML elements-instead of the complement documents in repose to the user query. In this paper, we provide an overview of the different XML information retrieval systems and classify them according to their storage and query evaluation strategies.
Efficient management of RDF data plays an important role in successfully understanding and fast q... more Efficient management of RDF data plays an important role in successfully understanding and fast querying data. Although the current approaches of indexing in RDF Triples such as property tables and vertically partitioned solved many issues; however, they still suffer from the performance in the complex self-join queries and insert data in the same table. As an improvement in this paper, we propose an alternative solution to facilitate flexibility and efficiency in that queries and try to reach to the optimal solution to decrease the self-joins as much as possible, this solution based on the idea of "Recursive Mapping of Twin Tables". Our main goal of Recursive Mapping of Twin Tables (RMTT) approach is divided the main RDF Triple into two tables which have the same structure of RDF Triple and insert the RDF data recursively. Our experimental results compared the performance of join queries in vertically partitioned approach and the RMTT approach using very large RDF data, l...
2020 International Conference on Innovative Trends in Communication and Computer Engineering (ITCE), 2020
Sentiment Analysis (SA) is an increasingly important field of study, also known as opinion mining... more Sentiment Analysis (SA) is an increasingly important field of study, also known as opinion mining, as it has the ability to identify the emotional tone of a source material as being either positive, negative, or neutral. Simply, SA digests natural languages and extracts insights, making it extremely useful to gain an overview of the public opinion in a certain issue, topic, or even a product. With the vast amount of information over social network platforms, shared views, website reviews, and blogs comes the importance of SA. Arabic is a rich language with extremely complex inflectional and derivational morphology making sentiment analysis in Arabic text more challenging. In this paper, we propose a novel approach to enhance the accuracy of Arabic Sentiment Analysis (ASA). In this aspect, nine supervised machine learning algorithms have been implemented for ASA. Three of these classifiers have never been used before in ASA classification, namely, they are Ridge, Gradient Boosting, a...
ZigBee or IEEE 802.15.4 is considered as a unique communication standard developed for wireless p... more ZigBee or IEEE 802.15.4 is considered as a unique communication standard developed for wireless personal area network. Zigbee is a low-rate (LR) communication network which provides flexibility, very low power consumption, ease of installation, reliable data transfer, short range operation, acceptable battery life, low data rate in an ad hoc self-organizing network among inexpensive fixed, and portable moving devices. It is developed for applications with relaxed throughput requirements which cannot handle the power consumption of heavy protocol stacks. Zigbee can be embedded in a wide range of products and applications across consumer, commercial, industrial and government markets. Zigbee can be considered as a promising technology which has a strong impact of the development of Wireless Sensor Network since this technology is taking care of the power energy and the communication overhead. In this paper, a cluster tree topology for 3 PAN coordinators supported by OPNET 17.5 is impl...
The increasing popularity of XML has generated a lot of interest in query processing over graph-s... more The increasing popularity of XML has generated a lot of interest in query processing over graph-structured data. To support efficient evaluation of path expressions structured indexes have been proposed. However, most variants of structures indexes ignore inter- or intra-document references. They assume a tree-like structure of XML-documents. Extending these indexes to work with large XML graphs and to support intra-or inter-document links requires a lot of computing power for the creation process and a lot of space to store the indexes. Moreover, the efficient evaluation of ancestors-descendants queries over arbitrary graphs with long paths is a severe problem. In this paper, we propose a scalable path index that is based on the concept of 2-hop covers as introduced by Cohen el al. The proposed algo-rithm for index creation scales down the original graph size substantially. As a result a directed acyclic graph with a smaller number of nodes and edges will emerge. This reduces the n...
In many fields, complicated issues can now be solved with the help of Artificial Intelligence (AI... more In many fields, complicated issues can now be solved with the help of Artificial Intelligence (AI) and Machine Learning (ML). One of the more modern Metaheuristic (MH) algorithms used to tackle numerous issues in various fields is the Beluga Whale Optimization (BWO) method. However, BWO has a lack of diversity, which could lead to being trapped in local optimaand premature convergence. This study presents two stages for enhancing the fundamental BWO algorithm. The initial stage of BWO’s Opposition-Based Learning (OBL), also known as OBWO, helps to expedite the search process and enhance the learning methodology to choose a better generation of candidate solutions for the fundamental BWO. The second step, referred to as OBWOD, combines the Dynamic Candidate Solution (DCS) and OBWO based on the k-Nearest Neighbor (kNN) classifier to boost variety and improve the consistency of the selected solution by giving potential candidates a chance to solve the given problem with a high fitness ...
ABSTRACT Many schema labelling approaches have been designed to facilitate querying of XML docume... more ABSTRACT Many schema labelling approaches have been designed to facilitate querying of XML documents. The proposed algorithms are based on the fact that ancestor–descendant relationships among nodes can be quickly determined. Schema labelling is a family of technologies widely used in indexing tree, graph, or structured XML graph, in which a unique identifier is assigned to each node in the tree/graph. The generated identifier is then used in indexing as a reference to the actual node so that structural relationship among the nodes can be quickly captured. In this paper, we extend the prime number schema labelling algorithm for labelling DAG XML graph. Our main contribution is scaling down the original XML graph size substantially based on the Strongly Connected Component (SCC) principles. Labelling each node in DAG with an integer that is the arithmetical multiplication of the prime number associating with the node and its parent label. The schema does not depend on spanning tree. Thus, subsumption hierarchies represented in a DAG can be efficiently explored by checking the divisibility among the labels. Also, it inherits dynamic update ability and compact size features from its predecessors. Our theoretical analysis and the experimental results showed that the generated labelled schema is an efficient and a scalable one for processing reachability queries on large XML graphs.
International Journal of Web Information Systems, 2010
PurposeInformation retrieval (IR) and feedback in Extensible Markup Language (XML) are rather new... more PurposeInformation retrieval (IR) and feedback in Extensible Markup Language (XML) are rather new fields for researchers; natural questions arise, such as: how good are the feedback algorithms in XML IR? Can they be evaluated with standard evaluation tools? Even though some evaluation methods have been proposed in the literature it is still not clear yet which of them are applicable in the context of XML IR, and which metrics they can be combined with to assess the quality of XML retrieval algorithms that use feedback. This paper aims to elaborate on this.Design/methodology/approachThe efficient evaluation of relevance feedback (RF) algorithms for XML collection posed interesting challenges on the IR and database researchers. The system based on the keyword‐based queries whether on the main query or in the RF processing instead of the XPath and structure query languages which were more complex. For measuring the efficiency of the system, the paper used the extended RF algorithms (re...
International Journal of Web Information Systems, 2009
PurposeThe increasing popularity of XML has generated a lot of interest in query processing over ... more PurposeThe increasing popularity of XML has generated a lot of interest in query processing over graph‐structured data. To support efficient evaluation of path expressions structured indexes have been proposed. Extending the proposed indexes to work with large XML graphs and to support intra‐ or inter‐document links requires a lot of computing power for the creation process and a lot of space to store the indexes. Moreover, the efficient evaluation of ancestors‐descendants queries over arbitrary graphs with long paths is a severe problem. This paper aims to propose a scalable path index which is based on the concept of 2‐hop covers as introduced by Cohen et al.Design/methodology/approachThe problem of efficiently managing and querying XML documents poses interesting challenges on database research. The proposed algorithm for index creation scales down the original graph size substantially. As a result a directed acyclic graph with a smaller number of nodes and edges will emerge. Thi...
This review presents various perspectives on converting user keywords into a formal query. Withou... more This review presents various perspectives on converting user keywords into a formal query. Without understanding the dataset’s underlying structure, how can a user input a text-based query and then convert this text into semantic protocol and resource description framework query language (SPARQL) that deals with the resource description framework (RDF) knowledge base? The user may not know the structure and syntax of SPARQL, a formal query language and a sophisticated tool for the semantic web (SEW) and its vast and growing collection of interconnected open data repositories. As a result, this study examines various strategies for turning natural language into formal queries, their workings, and their results. In an Internet search engine from a single query, such as on Google, numerous matching documents are returned, with several related to the inquiry while others are not. Since a considerable percentage of the information retrieved is likely unrelated, sophisticated information ...
The continuous growth in the XML information repositories has been matched by increasing efforts ... more The continuous growth in the XML information repositories has been matched by increasing efforts in development of XML retrieval systems, in large parts aiming at supporting content-oriented XML retrieval. These systems exploit the available structural information, as market up in XML documents, in order to return documents components- the so called XML elements-instead of the complement documents in repose to the user query. In this paper, we provide an overview of the different XML information retrieval systems and classify them according to their storage and query evaluation strategies.
Efficient management of RDF data plays an important role in successfully understanding and fast q... more Efficient management of RDF data plays an important role in successfully understanding and fast querying data. Although the current approaches of indexing in RDF Triples such as property tables and vertically partitioned solved many issues; however, they still suffer from the performance in the complex self-join queries and insert data in the same table. As an improvement in this paper, we propose an alternative solution to facilitate flexibility and efficiency in that queries and try to reach to the optimal solution to decrease the self-joins as much as possible, this solution based on the idea of "Recursive Mapping of Twin Tables". Our main goal of Recursive Mapping of Twin Tables (RMTT) approach is divided the main RDF Triple into two tables which have the same structure of RDF Triple and insert the RDF data recursively. Our experimental results compared the performance of join queries in vertically partitioned approach and the RMTT approach using very large RDF data, l...
2020 International Conference on Innovative Trends in Communication and Computer Engineering (ITCE), 2020
Sentiment Analysis (SA) is an increasingly important field of study, also known as opinion mining... more Sentiment Analysis (SA) is an increasingly important field of study, also known as opinion mining, as it has the ability to identify the emotional tone of a source material as being either positive, negative, or neutral. Simply, SA digests natural languages and extracts insights, making it extremely useful to gain an overview of the public opinion in a certain issue, topic, or even a product. With the vast amount of information over social network platforms, shared views, website reviews, and blogs comes the importance of SA. Arabic is a rich language with extremely complex inflectional and derivational morphology making sentiment analysis in Arabic text more challenging. In this paper, we propose a novel approach to enhance the accuracy of Arabic Sentiment Analysis (ASA). In this aspect, nine supervised machine learning algorithms have been implemented for ASA. Three of these classifiers have never been used before in ASA classification, namely, they are Ridge, Gradient Boosting, a...
ZigBee or IEEE 802.15.4 is considered as a unique communication standard developed for wireless p... more ZigBee or IEEE 802.15.4 is considered as a unique communication standard developed for wireless personal area network. Zigbee is a low-rate (LR) communication network which provides flexibility, very low power consumption, ease of installation, reliable data transfer, short range operation, acceptable battery life, low data rate in an ad hoc self-organizing network among inexpensive fixed, and portable moving devices. It is developed for applications with relaxed throughput requirements which cannot handle the power consumption of heavy protocol stacks. Zigbee can be embedded in a wide range of products and applications across consumer, commercial, industrial and government markets. Zigbee can be considered as a promising technology which has a strong impact of the development of Wireless Sensor Network since this technology is taking care of the power energy and the communication overhead. In this paper, a cluster tree topology for 3 PAN coordinators supported by OPNET 17.5 is impl...
Uploads