Filters








13,283 Hits in 4.8 sec

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 concludes with an account of the experience gained so far with the system, and discusses application areas where the LDL approach appears to be particularly effective.  ...  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  ...  Various extensions and improvements were added to the system as a result of this experience.  ... 
doi:10.1109/69.50907 fatcat:7hdqgrvklzf4zb2lm6xkejdk4a

The HERMIT in the Tree [chapter]

Neil Sculthorpe, Andrew Farmer, Andy Gill
2013 Lecture Notes in Computer Science  
Using HERMIT, we implement eleven examples of three program transformations, report on our experience, and describe improvements made in the process.  ...  in a general-purpose compiler, or because the developers' interest is in theory rather than implementation.  ...  This is unsurprising, as the HERMIT system is still in an early stage of development.  ... 
doi:10.1007/978-3-642-41582-1_6 fatcat:63iiwbzv2vftnjgbadbsddpmle

Towards an Exhaustive Set of Rewriting Rules for XQuery Optimization: BizQuery Experience [chapter]

Maxim Grinev, Sergey Kuznetsov
2002 Lecture Notes in Computer Science  
An algebra for rewriting is proposed. Besides query rewriting rules for FLWR expressions the rules for XQuery functions and recursive XQuery functions are presented.  ...  Today it is wildly recognized that optimization based on rewriting leads to faster query execution.  ...  An extension of these rules for rewriting queries with calls to userdefined functions is described in Section 4. Future work and conclusion appear in Section 5.  ... 
doi:10.1007/3-540-45710-0_27 fatcat:onzlu4iyqrdgzn54onwkjtjgmy

Evita raced

Tyson Condie, David Chu, Joseph M. Hellerstein, Petros Maniatis
2008 Proceedings of the VLDB Endowment  
Since these are relatively early research efforts, it is important that the architectures of these declarative systems be extensible, in order to accommodate unforeseen needs in these new domains.  ...  Specifically, we describe our design and implementation of Evita Raced, an extensible compiler for the OverLog language used in our declarative networking system, P2.  ...  Magic-Sets Rewrite The magic-sets rewrite is an optimization that can reduce the amount of computation in recursive Datalog queries, via a generalization of basic "selection pushdown" ideas.  ... 
doi:10.14778/1453856.1453978 fatcat:4wx4le2zwrh3zd42mbbbkk22lq

Industrial-strength parallel query optimization: Issues and lessons

Rosana S.G Lanzelotte, Patrick Valduriez, Mohamed Zaït, Mikal Ziane
1994 Information Systems  
The optimizer takes as input a query expressed in ESQL, an extension of SQL with objects and rules, and produces a minimum cost parallel execution plan.  ...  We also describe the current optimizer prototype and report on experiments performed with a pilot application. Finally, we present the lessons learned.  ...  The rewriter deals also with recursion, by identifying xpoint recursion and choosing an algorithm for computing it.  ... 
doi:10.1016/0306-4379(94)90017-5 fatcat:o3nki2mjy5hfhchfnm76t4ryge

Optimization of Linear Recursive Queries in SQL

Carlos Ordonez
2010 IEEE Transactions on Knowledge and Data Engineering  
Recursion is a fundamental computation mechanism which has been incorporated into SQL. This work focuses on the optimization of linear recursive queries in SQL.  ...  Experiments compare both evaluation algorithms and systematically evaluate the impact of optimizations with large input tables.  ...  In order to understand the importance of each each optimization we tested optimizations with the largest graphs analyzed in previous experiments.  ... 
doi:10.1109/tkde.2009.83 fatcat:qopingnlorfdhlnlygjrbcj6ly

Neural-Network Guided Expression Transformation [article]

Romain Edelmann, Viktor Kunčak
2019 arXiv   pre-print
In one of our experiments, our neural-network guided search algorithm is able to solve more instances with a 2 seconds timeout per instance than breadth-first search does with a 5 minutes timeout per instance  ...  Given an input expression and its optimized form, finding the sequence of rules that were applied is a non-trivial task.  ...  In this section, we discuss an alternative network architecture that we are experimenting with and that can handle expressions with an unbounded number of variables.  ... 
arXiv:1902.02194v1 fatcat:lavox3g7rva5bbjjuvf4hampxi

Extensible query processing in starburst

L. M. Haas, J. C. Freytag, G. M. Lohman, H. Pirahesh
1989 Proceedings of the 1989 ACM SIGMOD international conference on Management of data - SIGMOD '89  
Starburst's language processor features a powerful query language, rule-based optimization and query rewrite, and an execution system based on an extended relational algebra.  ...  In this paper, we describe the design of Starburst's query language processor and discuss the ways in which the language processor can be extended to achieve Starburst's goals.  ...  Mavis Lee and Waqar IIasan designed and implemented the rule-based optimizer prototype and the rule engine for query rewrite, respectively.  ... 
doi:10.1145/67544.66962 dblp:conf/sigmod/HaasFLP89 fatcat:ufyyowcivbftdjxe6pl5mkp4pq

Extensible query processing in starburst

L. M. Haas, J. C. Freytag, G. M. Lohman, H. Pirahesh
1989 SIGMOD record  
Starburst's language processor features a powerful query language, rule-based optimization and query rewrite, and an execution system based on an extended relational algebra.  ...  In this paper, we describe the design of Starburst's query language processor and discuss the ways in which the language processor can be extended to achieve Starburst's goals.  ...  Mavis Lee and Waqar IIasan designed and implemented the rule-based optimizer prototype and the rule engine for query rewrite, respectively.  ... 
doi:10.1145/66926.66962 fatcat:krr6nntibndmzn3tu4qeszvzja

Stratego/XT 0.16

Martin Bravenboer, Karl Trygve Kalleberg, Rob Vermaas, Eelco Visser
2006 Proceedings of the 2006 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation - PEPM '06  
In this paper we give an overview of Stratego/XT 0.16.  ...  of rules in the syntax of the object language, and dynamic rewrite rules for expressing context-sensitive transformations, thus supporting the development of transformation components at a high level  ...  , and an extensive manual with examples.  ... 
doi:10.1145/1111542.1111558 dblp:conf/pepm/BravenboerKVV06 fatcat:jn7aqbdnubc4dkowvkcm5ykh4e

SOFA: An Extensible Logical Optimizer for UDF-heavy Dataflows [article]

Astrid Rheinländer, Arvid Heise, Fabian Hueske, Ulf Leser, Felix Naumann
2013 arXiv   pre-print
equivalent plan rewrites than possible with traditional techniques.  ...  However, the heavy use of UDFs is not well taken into account for dataflow optimization in current systems. SOFA is a novel and extensible optimizer for UDF-heavy dataflows.  ...  We thank Martin Beckmann and Anja Kunkel for help with implementing the Meteor queries we used for evaluation, and we thank Volker Markl and Stephan Ewen for valuable discussion and feedback.  ... 
arXiv:1311.6335v1 fatcat:3sojpzy65vbgnetjygme655hwa

ML Pattern-Matching, Recursion, and Rewriting: From FoCaLiZe to Dedukti [chapter]

Raphaël Cauderlier, Catherine Dubois
2016 Lecture Notes in Computer Science  
In this paper we propose to extend the FoCaLiZe compiler by a backend to the Dedukti language -a proof checker for Deduction modulo -in order to benefit from Zenon Modulo, an extension of Zenon for Deduction  ...  The paper focusses mainly on the process that overcomes the lack of local pattern-matching and recursive definitions in Dedukti.  ...  Presentation of the tools Dedukti Dedukti [22] is a type checker for the λΠ-calculus modulo, an extension of a pure dependent type system, the λΠ-calculus, with rewriting.  ... 
doi:10.1007/978-3-319-46750-4_26 fatcat:3lcz3tnzsvejdlkvzpewkh4tty

Answering queries using views: A survey

Alon Y. Halevy
2001 The VLDB journal  
In query optimization, finding a rewriting of a query using a set of materialized views can yield a more efficient query execution plan.  ...  Finally, the problem arises in data integration systems, where data sources can be described as precomputed views over a mediated schema.  ...  We apply the rules of the program in an arbitrary order, starting with empty extensions for the IDB relations.  ... 
doi:10.1007/s007780100054 fatcat:hcqz2ztc4fd6logys72tab25zi

Dependency Injection for Programming by Optimization [article]

Zoltan A. Kocsis, Jerry Swan
2017 arXiv   pre-print
language extensions.  ...  However, in current approaches to Programming by Optimization, design space specification and exploration relies on external configuration algorithms, executable wrappers and fragile, preprocessed programming  ...  In principle ContainAnt could be used as its own hyper-heuristic to self-improve GrEvo. We experimented with these capabilities during the early days of development.  ... 
arXiv:1707.04016v1 fatcat:ynqlgvchvjcirg3kxokqendll4

Reader-Aware Multi-Document Summarization via Sparse Coding [article]

Piji Li, Lidong Bing, Wai Lam, Hang Li, Yi Liao
2015 arXiv   pre-print
The rewriting consideration is jointly assessed together with other summarization requirements under a unified optimization model.  ...  Extensive experiments on this data set and some classical data sets demonstrate the effectiveness of our proposed approach.  ...  We propose a compression-based unified optimization framework which explores a finer syntactic unit, namely, noun/verb phrase, to generate compressive summaries, and meanwhile it conducts entity rewriting  ... 
arXiv:1504.07324v1 fatcat:pernejvwgnc37imo3diulk44a4
« Previous Showing results 1 — 15 out of 13,283 results