Efficient algorithms for the instantiated transitive closure queries

Qadah, Ghassan Z.; Henschen, Lawrence J.; Kim, J.J.

doi:10.1109/32.75418

Cited by 18 publications

(7 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In order to test our protocol, The NS2 simulation software [10] is used. NS2 is a general-purpose simulation tool that provides discrete event simulation of user defined networks.…”

Section: Resultsmentioning

confidence: 99%

“…Mobile terminals communicate and interact with other terminals via wireless networks such as Wi-Fi or Bluetooth. They may spontaneously network with each other through their proximity and perform proximity applications [1][2][3][4][5][6][7][8][9][10]. These devices will become both sources and consumers of data and can communicate with other devices to meet individual or collective computing.…”

Section: Introductionmentioning

confidence: 99%

“…In such a mobile environment the special elements of the network is very dynamic and can be extremely volatile. Traditional query processing techniques [1][2][3][4][5][6][7][8][9][10][11][12], the global data and statistics collected according to the chart and the histogram is no longer such a very mobile environment, sufficient for many reasons, such as: limited resources, and powerful servers, the data types of terminals ranging from PDAs to communicate the type of energy to a higher bandwidth or limited this may be the heterogeneity bandwidth to a wired network with wireless network. In addition, the query optimization and execution of queries in order to evaluate effectively the account must take into account available resources.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Developing Xquery Model for Distributed Query Processing in Mobile Networks

Andamuthu¹,

Balasubramanie²

2011

IJCA

View full text Add to dashboard Cite

The emergence and popularity of mobile computing environment, so get a variety of semi-structured data to follow some common XML model. The Extensible Markup Language (XML) model has recently gained huge popularity because of its ability to represent a wide variety of structured and semistructured data. Several Query languages have been proposed for the XML data model, the most-widely known is XQuery. Traditional query processing to a database focused on structured data retrieval and structures to support them. In this paper we present a model and an algorithm for querying structured and semi -structured data for mobile computing environments based on the model of XQuery. We employ a variety of servers to handle different jobs. Buffer is maintained in the mobile node and the cache is stored in the query server, and mobile server. Priority is given to requests based on various parameters such as priority by the user, the required bandwidth, etc. parameters considered for performance measure of the effectiveness of the request, delivery ratio and average power consumption and the results show that the proposed algorithm works better than existing systems.

show abstract

“…In order to test our protocol, The NS2 simulation software [10] is used. NS2 is a general-purpose simulation tool that provides discrete event simulation of user defined networks.…”

Section: Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Developing Xquery Model for Distributed Query Processing in Mobile Networks

Andamuthu¹,

Balasubramanie²

2011

IJCA

View full text Add to dashboard Cite

show abstract

“…Many serial and parallel algorithms have been proposed to speedup the execution of these operations. Some of these algorithms and their performance evaluation can be found in [8], [9], [10], [11], [12], [13], [14]. …”

Section: The Relational Data Modelmentioning

confidence: 99%

Processing independent and inter-linked documents in XML databases

Qadah

2009

2009 IEEE International Conference on Information Reuse &Amp; Integration

View full text Add to dashboard Cite

The Extensible Markup Language (XML) model has recently gained huge popularity because of its ability to represent a wide variety of structured and semi-structured data. Several Query languages have been proposed for the XML data model, the most-widely known is XQuery. Traditional XML query processing research has concentrated on data retrieval from independent XML documents and on the associate structures. In this paper, we review these algorithms and structures and show their superiority when processing independent XML documents. However, the direct application of these algorithms to process queries against interlinked XML documents is shown to generate incorrect results. A new algorithm and the associate structures suitable to process queries against both independent and inter-linked XML data are developed and shown to generate correct results.

show abstract

“…Deductive databases and logic programming languages take advantage of a special kind of rule recursion called linear recursion since recursion improves the expressive power and intelligence of database systems (Arman, 2003). Therefore, efficient algorithms to process recursive rules and queries within the context of large deductive database systems has recently attracted a large amount of research efforts due to the important role of recursive rules in improving the intelligence of database systems and extending them into knowledge-base systems (Arman, 2004;Hopfner & Seipel, 2002;Elmasri & Navathe, 2010;Qadah et al, 1991). One of the main features of these intelligent database systems, namely deductive databases, is their ability to define recursive rules and to process queries on them directly.…”

Section: Introductionmentioning

confidence: 99%

A Materialized View for the Same Generation Query in Deductive Databases

Arman¹

2012

CIS

View full text Add to dashboard Cite

Traditionally, deductive databases are designed as extensions to relational databases by either integrating a logic programming language, such as PROLOG, with a conventional relational database system that provides storage persistence needed for any database system, or by integrating an expert system with a relational database system. Deductive databases take advantage of a special kind of rule recursion called linear recursion to provide inference capabilities to improve the intelligence of the database system. The simplicity of implementation of linear recursive rules, like same generation rules, is far from the difficulty and the cost of computing the results of queries based on these recursive rules. Thus, to reduce costs and improve performance of the same generation queries, many techniques were suggested. In this paper, we propose the use of materialized views to speed up the evaluation of these queries and explain how to maintain the materialized view if the underlying base relation is updated. Finally, simulations are used to compare the materialized view approach with other approaches that are used to compute the results of the same generation queries.

show abstract

Efficient algorithms for the instantiated transitive closure queries

Cited by 18 publications

References 7 publications

Developing Xquery Model for Distributed Query Processing in Mobile Networks

Developing Xquery Model for Distributed Query Processing in Mobile Networks

Processing independent and inter-linked documents in XML databases

A Materialized View for the Same Generation Query in Deductive Databases

Contact Info

Product

Resources

About