Fuzzy logic-based approximate event notification in sparse MANETs

Mobile Ad-Hoc Networks (MANETs) are an important communication infrastructure to support emergency and rescue operations. To address the frequent disconnections and network partitions that might occur, we have developed a distributed event notification service (DENS) for sparse MANETs. In most event notification solutions, subscriptions are formed with crisp values or crisp value ranges. However, in emergency and rescue operations subscribers may not always have time to give crisp values or crisp value ranges. Moreover, subscriber's interests in queries have gradual nature and subjective measure that calls for computing by words. Therefore, we design and implement a simple fuzzy concept based subscription language allowing more expressive subscriptions and more sophisticated event-filtering. It is built on two new ideas: using features as multi-attribute indexes of the subscription and predicate patterns for processing subscriptions with arbitrary Boolean operators. However, requiring more computational efforts, fuzzy logic introduces performance penalties in the whole network. The proposed services have been evaluated for run-time, space and scalability efficiency. The proposed design framework is extensible to the user- and application-semantics and configurable to the dynamics in data that publish/subscribe paradigm imposes at runtime

Rewriting Declarative Query Languages

Queries against databases are formulated in declarative languages. Examples are the relational query language SQL and XPath or XQuery for querying data stored in XML. Using a declarative query language, the querist does not need to know about or decide on anything about the actual strategy a system uses to answer the query. Instead, the system can freely choose among the algorithms it employs to answer a query. Predominantly, query processing in the relational context is accomplished using a relational algebra. To this end, the query is translated into a logical algebra. The algebra consists of logical operators which facilitate the application of various optimization techniques. For example, logical algebra expressions can be rewritten in order to yield more efficient expressions. In order to query XML data, XPath and XQuery have been developed. Both are declarative query languages and, hence, can benefit from powerful optimizations. For instance, they could be evaluated using an algebraic framework. However, in general, the existing approaches are not directly utilizable for XML query processing. This thesis has two goals. The first goal is to overcome the above-mentioned misfits of XML query processing, making it ready for industrial-strength settings. Specifically, we develop an algebraic framework that is designed for the efficient evaluation of XPath and XQuery. To this end, we define an order-aware logical algebra and a translation of XPath into this algebra. Furthermore, based on the resulting algebraic expressions, we present rewrites in order to speed up the execution of such queries. The second goal is to investigate rewriting techniques in the relational context. To this end, we present rewrites based on algebraic equivalences that unnest nested SQL queries with disjunctions. Specifically, we present equivalences for unnesting algebraic expressions with bypass operators to handle disjunctive linking and correlation. Our approach can be applied to quantified table subqueries as well as scalar subqueries. For all our results, we present experiments that demonstrate the effectiveness of the developed approaches