Filters








49,908 Hits in 6.1 sec

Efficient optimization and processing for distributed monitoring and control applications

Mengmeng Liu
2012 Proceedings of the on SIGMOD/PODS 2012 PhD Symposium - PhD '12  
adaptive query processing systems.  ...  In particular, we make the following contributions: 1) supporting the maintenance of recursive queries over distributed data streams, 2) enabling full-fledged cost-based incremental query re-optimization  ...  The goal of adaptive query processing is to generate a series of plans, ideally minimizing the overall latency to data streams.  ... 
doi:10.1145/2213598.2213615 dblp:conf/sigmod/Liu12 fatcat:6hzc4ilrcbap5b75oc6uej74he

The generalized counting method for recursive logic queries

Domenico Saccà, Carlo Zaniolo
1986 Theoretical Computer Science  
In particular, the situation is studied where the initial bindings of the arguments in the recursive query goal can be used in the top-down (as in backward chaining) execution phase to improve the efficiency  ...  A general method is given for solving these queries; the method performs an analysis of the binding passing behavior of the query, and then reschedules the overall execution as two fixpoint computations  ...  Acknowledgments: The authors are grateful to Francois Bancilhon, Ravi Krishnamurthy and Raghu Ramakrishan for many inspiring discussions.  ... 
doi:10.1016/0304-3975(86)90015-0 fatcat:tspr65qauvfv5aso6dnf574fp4

The generalized counting method for recursive logic queries [chapter]

Domenico Saccà, Carlo Zaniolo
1986 Lecture Notes in Computer Science  
In particular, the situation is studied where the initial bindings of the arguments in the recursive query goal can be used in the top-down (as in backward chaining) execution phase to improve the efficiency  ...  A general method is given for solving these queries; the method performs an analysis of the binding passing behavior of the query, and then reschedules the overall execution as two fixpoint computations  ...  Acknowledgments: The authors are grateful to Francois Bancilhon, Ravi Krishnamurthy and Raghu Ramakrishan for many inspiring discussions.  ... 
doi:10.1007/3-540-17187-8_28 fatcat:5pedcl3uszhkzi5437nrhn2wrm

Implementation of Recursive Queries for Information Systems

Kazem Taghva, Jayalakshmi Jeyaraman
2008 2008 19th International Conference on Systems Engineering  
In the next section we will see what recursion is and how the logic databases that involve recursive queries are represented using rule/goal graph.  ...  Let us see the tables we use and recursive queries that we solve in detail.  ... 
doi:10.1109/icseng.2008.8 fatcat:ath2umuucfc2jfmjaujzen2vrm

Programming-By-Example by Programming-By-Example: Synthesis of Looping Programs [article]

Shmuel Berman, Mark Santolucito
2021 arXiv   pre-print
We solve constraints individually and treat them as "unrolled" examples of how a recursive program would behave, and solve for the generalized recursive solution.  ...  We introduce an multi-phase algorithm for the synthesis of recursive "looplike" programs in SyGuS for programming-by-example.  ...  Recursive programs are useful for modeling a variety of realistic synthesis scenarios and significant work has been done towards this goal. Madhusudan [2] and Krogmeier Krogmeier et al.  ... 
arXiv:2108.08724v1 fatcat:b4f43dhiunbfdk6dolhifwwxz4

The LDL system prototype

D. Chimenti, R. Gamboa, R. Krishnamurthy, S. Naqvi, S. Tsur, C. Zaniolo
1990 IEEE Transactions on Knowledge and Data Engineering  
The paper further contains a description of the architecture and runtime environment of the system and the optimization techniques employed in order to improve the performance and assure the safety of  ...  This paper contains a comprehensive overview of the system and contains a description of the LDL language and the compilation techniques employed to translate LDL queries into target queries on the stored  ...  Indeed, observe that in the succession of recursive calls generated by the goal sg(marc, X), X and XP are bound whereas Y and YP are not.  ... 
doi:10.1109/69.50907 fatcat:7hdqgrvklzf4zb2lm6xkejdk4a

Optimization in a logic based language for knowledge and data intensive applications [chapter]

Ravi Krishnamurthy, Carlo Zaniolo
1988 Lecture Notes in Computer Science  
In order to generalize the strategy successfully used in relational database systems we first characterize the optimization problem in terms of its execution space, cost functions and search algorithm.  ...  Then we extend this framework to deal with rules, complex terms, recursion and various problems resulting from the richer expressive power of Logic.  ...  Execution Space Note that many processing trees can be generated for any given query and a given set of rules.  ... 
doi:10.1007/3-540-19074-0_45 fatcat:zl3orishina7nmkifgirubrbvm

Querying Proofs [chapter]

David Aspinall, Ewen Denney, Christoph Lüth
2012 Lecture Notes in Computer Science  
The core language presented in this paper is locally structured, with queries built using recursion and patterns over proof structure and rule names.  ...  We define the syntax and semantics of locally structured queries, demonstrate their power, and sketch some implementation experiments.  ...  Querying Proofs  ... 
doi:10.1007/978-3-642-28717-6_10 fatcat:uczu7tdy6jhbrehrf6recdtqie

Control and optimization strategies in the implementation of LDL

R. Krishnamurthy, Carlo Zaniolo
1990 Advances in database programming languages  
A relational system uses knowledge of storage structures, information about database statistics, and various estimates to predict the cost of execution schemes chosen from a predefined search space and  ...  In addition, its rule-based deductive capability and its unification-based pattern matching capability make it very suitable for knowledge-based and symbolic applications.  ...  EXECUTION SPACE Note that many processing trees can be generated for any given query and a given set of rules.  ... 
doi:10.1145/101620.101640 dblp:conf/dbpl/KrishnamurthyZ87 fatcat:qp7y42ynzbfcdjoivqpu6e6uru

Controlling recursive inference

David E. Smith, Michael R. Genesereth, Matthew L. Ginsberg
1986 Artificial Intelligence  
We first review a well-known syntactic method for controlling repeating inference (inference where the conjuncts processed are instances of their ancestors), provide a proof that it is correct, and discuss  ...  In general, the control of recursive inference involves demonstrating that recursive portions of a search space will not contribute any new answers to the problem beyond a certain level.  ...  Jim Bennett, Jan Clayton and Ted Shortliffe provided information on self-referencing rules and loops in MYCIN and EMYCIN.  ... 
doi:10.1016/0004-3702(86)90003-2 fatcat:etyxpuofbfftndrr777nzxglku

Page 2911 of Mathematical Reviews Vol. , Issue 2000d [page]

2000 Mathematical Reviews  
Summary: “The goal of knowledge compilation is to transform programs in order to speed up their evaluation.  ...  in the goals F(X, Y) and H(X, Z) are defined in a given program P, and newp is a predicate symbol not occurring in P.  ... 

Processing recursive XQuery over XML streams: The Raindrop approach

Mingzhu Wei, Elke A. Rundensteiner, Murali Mani, Ming Li
2008 Data & Knowledge Engineering  
In addition, depending on whether the query is recursive, we will generate the plan with cheaper operators whenever possible. We incorporate the proposed techniques into the Raindrop stream engine.  ...  In this paper, we propose a new class of stream algebra operators for efficient recursive XQuery stream processing.  ...  The goal of [4] is to minimize the buffer size. Again, recursion handling is not considered in their work.  ... 
doi:10.1016/j.datak.2007.09.007 fatcat:y5bn5grqhjgtfivowvhj3jc6za

Processing Recursive XQuery over XML Streams: The Raindrop Approach

Mingzhu Wei, Ming Li, E.A. Rundensteiner, M. Mani
2006 22nd International Conference on Data Engineering Workshops (ICDEW'06)  
In addition, depending on whether the query is recursive, we will generate the plan with cheaper operators whenever possible. We incorporate the proposed techniques into the Raindrop stream engine.  ...  In this paper, we propose a new class of stream algebra operators for efficient recursive XQuery stream processing.  ...  The goal of [4] is to minimize the buffer size. Again, recursion handling is not considered in their work.  ... 
doi:10.1109/icdew.2006.119 dblp:conf/icde/WeiLRM06 fatcat:quipesvew5eb3jpyd2janggs4i

Enabling Incremental Query Re-Optimization [article]

Mengmeng Liu, Zachary G. Ives, Boon Thau Loo
2014 arXiv   pre-print
As declarative query processing techniques expand in scope --- to the Web, data streams, network routers, and cloud platforms --- there is an increasing need for adaptive query processing techniques that  ...  Hence, they generally result in adaptive schemes that can only react slowly to updates.  ...  Beyond query optimization, our techniques are broadly useful in the evaluation of recursive datalog queries.  ... 
arXiv:1409.6288v1 fatcat:mtjxm43idnaxjbmhpp4m2jbssq

Application of Methods for Syntax Analysis of Context-Free Languages to Query Evaluation of Logic Programs [article]

Heike Stephan
2014 arXiv   pre-print
My research goal is to employ a parser generation algorithm based on the Earley parsing algorithm to the evaluation and compilation of queries to logic programs, especially to deductive databases.  ...  This automaton can be compiled to executable code; thus we expect a speedup in runtime of query evaluation.  ...  and avoid their recomputation.  ... 
arXiv:1405.3826v1 fatcat:45s7ighu4natvdnptoof5gg6ry
« Previous Showing results 1 — 15 out of 49,908 results