Filters








7,126 Hits in 4.1 sec

Optimization of object-oriented recursive queries using cost-controlled strategies

Rosana S. G. Lanzelotte, Patrick Valduriez, Mohamed Zaït
1992 Proceedings of the 1992 ACM SIGMOD international conference on Management of data - SIGMOD '92  
In [LVZC91] , we have proposed a comprehensive approach for optimizing non-recursive queries on *This work was partially funded by the Esprit project EDS.  ...  The granule is one arc of the query graph and its involved paths; subproblems (e.g., one path or one spj) to reduce the global complexity.  ... 
doi:10.1145/130283.130322 dblp:conf/sigmod/LanzelotteVZ92 fatcat:qrdcrvk73jhhbpycf3slacv4hu

Optimization of object-oriented recursive queries using cost-controlled strategies

Rosana S. G. Lanzelotte, Patrick Valduriez, Mohamed Zaït
1992 SIGMOD record  
In [LVZC91] , we have proposed a comprehensive approach for optimizing non-recursive queries on *This work was partially funded by the Esprit project EDS.  ...  The granule is one arc of the query graph and its involved paths; subproblems (e.g., one path or one spj) to reduce the global complexity.  ... 
doi:10.1145/141484.130322 fatcat:evckrprkcjem5irk75ad3fumca

From relation algebra to semi-join algebra

Jelle Hellings, Catherine L. Pilachowski, Dirk Van Gucht, Marc Gyssens, Yuqing Wu
2017 Proceedings of The 16th International Symposium on Database Programming Languages - DBPL '17  
Many graph query languages rely on the composition operator to navigate graphs and select nodes of interests, even though evaluating compositions of relations can be costly.  ...  Pilachowski, Dirk Van Gucht, Marc Gyssens, and Yuqing Wu. 2017. From relation algebra to semi-join algebra: an approach for graph query optimization.  ...  Instead of relying on composition for graph navigation, one can consider using the semi-join operators and .  ... 
doi:10.1145/3122831.3122833 dblp:conf/dbpl/HellingsPGGW17 fatcat:4f2ytnvfprdc7le3e44kbp6njq

OUP accepted manuscript

2020 Computer journal  
Many graph query languages rely on the composition operator to navigate graphs and select nodes of interests, even though evaluating compositions of relations can be costly.  ...  Pilachowski, Dirk Van Gucht, Marc Gyssens, and Yuqing Wu. 2017. From relation algebra to semi-join algebra: an approach for graph query optimization.  ...  Instead of relying on composition for graph navigation, one can consider using the semi-join operators and .  ... 
doi:10.1093/comjnl/bxaa031 fatcat:ulnwq2b3sbeahgysmmtkzs6mvm

Optimizing recursive queries in SQL

Carlos Ordonez
2005 Proceedings of the 2005 ACM SIGMOD international conference on Management of data - SIGMOD '05  
Recursion represents an important addition to the SQL language. This work focuses on the optimization of linear recursive queries in SQL.  ...  In general, the proposed optimizations produce a significant reduction in the evaluation time of recursive queries.  ...  Composite keys may require special join optimizations. Some queries on highly connected graphs may produce too many rows; for instance, showing all potential paths between pairs of vertices.  ... 
doi:10.1145/1066157.1066260 dblp:conf/sigmod/Ordonez05 fatcat:shxhnniqdnffxixfj6hwf36k3e

REX: Recursive, Delta-Based Data-Centric Computation [article]

Svilen R. Mihaylov, Zachary G. Ives, Sudipto Guha
2012 arXiv   pre-print
In today's Web and social network environments, query workloads include ad hoc and OLAP queries, as well as iterative algorithms that analyze data relationships (e.g., link analysis, clustering, learning  ...  We present a programming model oriented around deltas, describe how we execute and optimize such programs in our REX runtime system, and validate that our platform also handles failures gracefully.  ...  SQL has many of the features desired in a high-level MapReduce abstraction: composition, joins, and even support for recursive queries.  ... 
arXiv:1208.0089v1 fatcat:kc55jzf3e5fqlme5xxwkrqplu4

REX

Svilen R. Mihaylov, Zachary G. Ives, Sudipto Guha
2012 Proceedings of the VLDB Endowment  
In today's Web and social network environments, query workloads include ad hoc and OLAP queries, as well as iterative algorithms that analyze data relationships (e.g., link analysis, clustering, learning  ...  We present a programming model oriented around deltas, describe how we execute and optimize such programs in our REX runtime system, and validate that our platform also handles failures gracefully.  ...  SQL has many of the features desired in a high-level MapReduce abstraction: composition, joins, and even support for recursive queries.  ... 
doi:10.14778/2350229.2350246 fatcat:pfzv4hkikjgjzcwwt5hv6gg4vi

Horton+

Mohamed Sarwat, Sameh Elnikety, Yuxiong He, Mohamed F. Mokbel
2013 Proceedings of the VLDB Endowment  
It employs a query language, query optimizer, and a distributed execution engine.  ...  We introduce three algebraic operators, select, traverse, and join, and a query is compiled into an execution plan containing these operators.  ...  We support this argument with anecdotal evidence: Figure 9 depicts query Q3 (from Table 3 ) in a procedural language (i.e., Java) in Giraph.  ... 
doi:10.14778/2556549.2556573 fatcat:32clck4bj5bctebdbbcrioevia

:{unav)

Torsten Grust, Marc H. Scholl
2012 Journal of Intelligent Information Systems  
Compilers and optimizers for declarative query languages use some form of intermediate language to represent user-level queries.  ...  Based on the principle of structural recursion we extend the language by monad comprehensions (which provide us with a calculus-style sublanguage that proves to be useful during the optimization of nested  ...  push-down and join-order transformations, we could further optimize the resulting normal form.  ... 
doi:10.1023/a:1008705026446 fatcat:etk6p72tvrbjxhnete6a6ww6si

Fiber processing of queries on hierarchical data

Andrzej Sikorski
2012 Automatyka/Automatics  
Unlike [6] [6] we still go on with the independent processing of individual joins, solving two issues typical for HTJ -sub-optimality of both parent-child joins and IO operations on inputs.  ...  Complex path queries can be obtained by a composition of multiple operators (i.e. aggregation of fibers) that embeds them recursively. The fiber SJ operator is given in Figure 3 .  ... 
doi:10.7494/automat.2012.16.2.165 fatcat:4l5llu3elrfcfmuv2rcygk7fty

Composing, optimizing, and executing plans for bioinformatics web services

Snehal Thakkar, José Luis Ambite, Craig A. Knoblock
2005 The VLDB journal  
In this paper, we present our approach to automatically generate composition plans for web services, optimize the composition plans, and execute these plans efficiently.  ...  The first optimization technique, called tuple-level filtering, analyzes the source/service descriptions in order to automatically insert filtering conditions in the composition plans that result in fewer  ...  Acknowledgements We would like to thank Mark Carman, Louiqa Raschid, and the anonymous reviewers for their insightful comments that helped to improve the paper.  ... 
doi:10.1007/s00778-005-0158-4 fatcat:rmslk6e3vjgatg2nmzl2monojy

Graphs-at-a-time

Huahai He, Ambuj K. Singh
2008 Proceedings of the 2008 ACM SIGMOD international conference on Management of data - SIGMOD '08  
Experimental results on real and synthetic large graphs demonstrate that our graph specific optimizations outperform an SQL-based implementation by orders of magnitude.  ...  We propose a query language for graph databases that supports arbitrary attributes on nodes, edges, and graphs.  ...  The code and data used in the paper are available at http://www.sigmod.org/codearchive/ sigmod2008/.  ... 
doi:10.1145/1376616.1376660 dblp:conf/sigmod/HeS08 fatcat:dpsin5wpj5azffiqlvttjjs3oa

Recursive Graph Pattern Matching [chapter]

Gergely Varró, Ákos Horváth, Dániel Varró
2008 Lecture Notes in Computer Science  
complex patterns and/or transformation rules by pattern composition (or pattern call).  ...  We present core data structures and algorithms for matching graph patterns with general recursion.  ...  As a result this representation pin-points the crucial parts of recursive pattern matching, namely (i) optimized ordering of natural joins, and (ii) effective evaluation of leastfix points for which our  ... 
doi:10.1007/978-3-540-89020-1_31 fatcat:bmuyy3wqi5fpxmssaelbefjwlu

Algebraic optimization of object-oriented query languages

Catriel Beeri, Yoram Kornatzky
1993 Theoretical Computer Science  
Beeri, C. and Y. Kornatzky, Algebraic optimization of object-oriented query languages, Theoretical Computer Science 116 (1993) 59-94.  ...  We suggest such an algebraic optimization framework which is based on the computational metaphor of processing bulk data.  ...  Acknowledgment Sophie Cluet and Patrick Valduriez have pointed out to us the usefulness of the transformation for converting deep filters to shallow filters.  ... 
doi:10.1016/0304-3975(93)90220-n fatcat:qdvum2niibhh5bfbdlcxtld3kq

i3QL

Ralf Mitschke, Sebastian Erdweg, Mirko Köhler, Mira Mezini, Guido Salvaneschi
2014 Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications - OOPSLA '14  
To improve performance, i3QL optimizes user-defined queries by applying algebraic laws and partial evaluation.  ...  An incremental computation updates its result based on a change to its input, which is often an order of magnitude faster than a recomputation from scratch.  ...  recursion. • We present incremental operators based on relational algebra that are compositional and reusable. 1 Query plans are often used in database systems to guide engineers towards a design that  ... 
doi:10.1145/2660193.2660242 dblp:conf/oopsla/MitschkeEKMS14 fatcat:ihhjki3e75dedd7avyqkphvlzq
« Previous Showing results 1 — 15 out of 7,126 results