Relevant bibliographies by topics / SQL recursive query

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'SQL recursive query'

Author: Grafiati
Published: 4 June 2025
Last updated: 6 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'SQL recursive query.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "SQL recursive query"

1

Eiter, Thomas, Magdalena Ortiz, Mantas Simkus, Trung-Kien Tran, and Guohui Xiao. "Query Rewriting for Horn-SHIQ Plus Rules." Proceedings of the AAAI Conference on Artificial Intelligence 26, no. 1 (2021): 726–33. http://dx.doi.org/10.1609/aaai.v26i1.8219.

Full text
Abstract:
Query answering over Description Logic (DL) ontologies has become a vibrant field of research. Efficient realizations often exploit database technology and rewrite a given query to an equivalent SQL or Datalog query over a database associated with the ontology. This approach has been intensively studied for conjunctive query answering in the DL-Lite and EL families, but is much less explored for more expressive DLs and queries. We present a rewriting-based algorithm for conjunctive query answering over Horn-SHIQ ontologies, possibly extended with recursive rules under limited recursion as in DL+log. This setting not only subsumes both DL-Lite and EL, but also yields an algorithm for answering (limited) recursive queries over Horn-SHIQ ontologies (an undecidable problem for full recursive queries). A prototype implementation shows its potential for applications, as experiments exhibit efficient query answering over full Horn-SHIQ ontologies and benign downscaling to DL-Lite, where it is competitive with comparable state of the art systems.
APA, Harvard, Vancouver, ISO, and other styles
2

Fischer, Tim, Denis Hirn, and Torsten Grust. "SQL Engines Excel at the Execution of Imperative Programs." Proceedings of the VLDB Endowment 17, no. 13 (2024): 4696–708. https://doi.org/10.14778/3704965.3704976.

Full text
Abstract:
SQL query engines can act as efficient runtime environments for the execution of imperative programs over database-resident tabular data. To make this point, we lay out the details of a compilation strategy that maps the basic blocks of arbitrarily branching and looping control flow graphs into plain---possibly recursive---SQL:1999 common table expressions. The compiler does not stumble when faced with imperative programs of several hundred lines and emits SQL code that can execute such programs over entire batches of input arguments. These batches create opportunities for parallel program evaluation which contemporary query decorrelation techniques exploit automatically. SQL engines that already support UDFs may find the present program execution approach to outperform their native implementation---SQL engines without such support may gain UDF capabilities without the need to build a dedicated interpreter.
APA, Harvard, Vancouver, ISO, and other styles
3

Nguyen, Tran Quoc Vinh, Thanh Hao Dang, Duong Thu Hang Pham, Alsadoon Abeer, Chandana Prasad PW, and Viet Anh Nguyen. "A SOLUTION FOR SYNCHRONOUS INCREMENTAL MAINTENANCE OF MATERIALIZED VIEWS BASED ON SQL RECURSIVE QUERY." Eastern-European Journal of Enterprise Technologies 5, no. 2 (101) (2019): 6–17. https://doi.org/10.15587/1729-4061.2019.180226.

Full text
Abstract:
Materialized views are excessively stored query execution results in the database. They can be used to partially or completely answer queries which will be further appeared instead of re-executing query from the scratch. There is a large number of published works that address the maintenance, especially incremental update, of materialized views and query rewriting for using those ones. Some of them support materialized views based on recursive query in datalog language. Although most of datalog queries can be transferred into SQL queries and vise versa but it is not the case for recursive queries. Recursive queries in the data log try to find all possible transitive closures. Recursive queries in SQL (Common Table Expression – CTE) return direct links but not transitive closures. In this paper, we propose efficient methods for incremental update of materialized views based on CTE; and then propose an algorithm for generating source codes in C language for any input SQL recursive queries. The synthesized source codes implement our proposed incremental update algorithms according to inserted/deleted/updated record set in the base tables. This paper focuses mainly on the recursive queries whose execution results are directed tree-structured data. The two cases of tree node are considered. In the first case, a child node has only one parent node and in the second case, a child node can have many parent nodes. Those two cases represent the two types of relationships between entities in real world, that are one–to–many and many–to–many, respectively. For the one–to–many relationships, the relationship data is accompanied with the records describing the child using some fields. Those fields are set as null in deleting a concrete relationship. For the many–to–many relationships, it is stored in a separate table and the concrete relationships are removed by deleting describing records from that table. Considering of enforcing referential integrity may help to reduce the searching space and therefore, help to improve the performance. However, the set of tree nodes or tree edges can be manipulated. All those combinations lead to different algorithms. The experimental results are provided and discussed to confirm the effectiveness of our proposed methods
APA, Harvard, Vancouver, ISO, and other styles
4

Wiśniewski, Piotr, Marta Burzańska, and Przemysław Krukowski. "Extending DQL with Recursive Facilities." Annales Universitatis Mariae Curie-Sklodowska, sectio AI – Informatica 16, no. 1 (2016): 12. http://dx.doi.org/10.17951/ai.2016.16.1.12.

Full text
Abstract:
<p class="artSummaryshort">Object Relational Mappings reduce a gap between Relational Databases and programming languages. However, only the simplest operations are covered by the ORM frameworks. Most facilities provided by DBMSs are not usable via ORM. Among such features are recursive queries, introduced in SQL:99 standard. This paper presents integration of Recursive Common Table Expressions with Doctrine Query Language - a part of Doctrine ORM framework for PHP.</p>
APA, Harvard, Vancouver, ISO, and other styles
5

Markitan, Volodymyr, Mykola Vozniak, Lesia Bulatetska, and Vitalii Bulatetskyi. "PRESERVATION OF HIERARCHY STRUCTURES IN RELATIVE DATABASES." Cybersecurity: Education, Science, Technique 16, no. 4 (2022): 85–97. http://dx.doi.org/10.28925/2663-4023.2022.16.8597.

Full text
Abstract:
Relational database management systems and the SQL language itself do not have any built-in mechanisms for storing and managing hierarchical structures. There are several different ways to represent trees in relational databases. This paper considers the method of modeling hierarchical data structures in the form of Adjacency Lists and Closure Tables. For each method, there are examples of writing queries to solve typical problems encountered when working with tree structures: finding all descendant leaves, all descendants and ancestors of a given leaf, moving a leaf to another ancestor leaf, and deleting leaves with all its descendants. The possibility of using recursive queries when displaying the entire tree in the Adjacency List model is considered. If the depth of the tree is not known, or it is not known at what level the specified element is, the query can not be built by standard means of the SELECT statement, then you need to create a recursive procedure, or write a recursive query. In order to avoid recursion when outputting the whole tree, all nodes of the subtree, and finding the path from a certain place to the root, the modeling of hierarchical data structures is performed in the form of a connection table (Closure Table). This complicates the process of adding a new leaf and moving the leaf to another ancestor leaf. In this case, to simplify the writing of queries, it is suggested to create triggers that will build or rebuild the links. Given the fact that sometimes there is a need to preserve dependent, in particular hierarchical structures in a relational database, you need to be able to plow the model of preservation of such data. The choice of method for solving a specific problem is influenced by the speed of basic operations with trees. Exploring different options for organizing SQL tree structures will allow you to understand and choose the best way to build such a structure in a relational database for a specific task. All SQL queries in this paper were created and tested for Oracle relational databases.
APA, Harvard, Vancouver, ISO, and other styles
6

Ares, Gonzalo, César Castañón Fernández, and Isidro Diego Álvarez. "Ultimate Pit-Limit Optimization Algorithm Enhancement Using Structured Query Language." Minerals 13, no. 7 (2023): 966. http://dx.doi.org/10.3390/min13070966.

Full text
Abstract:
Three-dimensional block models are the most widely used tool for the study and evaluation of ore deposits, the calculation and design of economical pits, mine production planning, and physical and numerical simulations of ore deposits. The way these algorithms and computational techniques are programmed is usually through complex C++, C# or Python libraries. Database programming languages such as SQL (Structured Query Language) have traditionally been restricted to drillhole sample data operation. However, major advances in the management and processing of large databases have opened up the possibility of changing the way in which block model calculations are related to the database. Thanks to programming languages designed to manage databases, such as SQL, the traditional recursive traversal of database records is replaced by a system of database queries. In this way, with a simple SQL, numerous lines of code are eliminated from the different loops, thus achieving a greater calculation speed. In this paper, a floating cone optimization algorithm is adapted to SQL, describing how economical cones can be generated, related and calculated, all in a simple way and with few lines of code. Finally, to test this methodology, a case study is developed and shown.
APA, Harvard, Vancouver, ISO, and other styles
7

Fan, Wenfei, Jeffrey Xu Yu, Jianzhong Li, Bolin Ding, and Lu Qin. "Query translation from XPath to SQL in the presence of recursive DTDs." VLDB Journal 18, no. 4 (2009): 857–83. http://dx.doi.org/10.1007/s00778-008-0131-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Gu, Binbin, Juncheng Fang, and Faisal Nawab. "PoneglyphDB: Efficient Non-interactive Zero-Knowledge Proofs for Arbitrary SQL-Query Verification." Proceedings of the ACM on Management of Data 3, no. 1 (2025): 1–27. https://doi.org/10.1145/3709713.

Full text
Abstract:
In database applications involving sensitive data, the dual imperatives of data confidentiality and provable (verifiable) query processing are important. This paper introduces PoneglyphDB, a database system that leverages non-interactive zero-knowledge proofs (ZKP) to support both confidentiality and provability. Unlike traditional databases, PoneglyphDB enhances confidentiality by ensuring that raw data remains exclusively with the host, while also enabling verifying the correctness of query responses by providing proofs to clients. The main innovation in this paper is proposing efficient ZKP designs (called circuits) for basic operations in SQL query processing. These basic operation circuits are then combined to form ZKP circuits for larger, more complex queries. PoneglyphDB's circuits are carefully designed to be efficient by utilizing advances in cryptography such as PLONKish-based circuits, recursive proof composition techniques, and designing with low-order polynomial constraints. We demonstrate the performance of PoneglyphDB with the standard TPC-H benchmark. Our experimental results show that PoneglyphDB can efficiently achieve both confidentiality and provability, outperforming existing state-of-the-art ZKP methods.
APA, Harvard, Vancouver, ISO, and other styles
9

Xiong, Xiao Mei. "A Buffer Pool Optimization Algorithm Based on Max-Heap." Advanced Materials Research 945-949 (June 2014): 2439–42. http://dx.doi.org/10.4028/www.scientific.net/amr.945-949.2439.

Full text
Abstract:
To reduce the number of requests to the database connection, this paper designed the max-heap in buffer pool. We use the buffer pool maintenance algorithm to manage SQL data query request when database access intensive. When we update the max-heap, the structure of the buffer pool will be updated and the heap will be balance through the heap of recursive sequence, it got good performance in database access request. Experiment results show that this algorithm can improve the operation efficiency of system effectively.
APA, Harvard, Vancouver, ISO, and other styles
10

Vinh, Nguyen Tran Quoc, Dang Thanh Hao, Pham Duong Thu Hang, Abeer Alsadoon, PW Chandana Prasad, and Nguyen Viet Anh. "A solution for synchronous incremental maintenance of materialized views based on SQL recursive query." Eastern-European Journal of Enterprise Technologies 5, no. 2 (101) (2019): 6–17. http://dx.doi.org/10.15587/1729-4061.2019.180226.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "SQL recursive query"

1

Boniewicz, Aleksandra. "Optymalizacja warstwy dostępu do danych w aplikacjach korzystających z odwzorowań obiektowo-relacyjnych." Doctoral thesis, 2014. https://depotuw.ceon.pl/handle/item/1542.

Full text
Abstract:
Współczesne aplikacje są budowane za pomocą obiektowych języków programowania. Do składowania danych trwałych najczęściej stosuje się jednak bazy danych o relacyjnym modelu danych, który istotnie różni się od obiektowego. Utrwalanie danych aplikacji w bazie danych wymaga więc niebanalnego odwzorowania obiektów. Chociaż takie odwzorowanie można zaprogramować od nowa na użytek danej aplikacji, warto jednak także rozważyć zastosowanie gotowych bibliotek do odwzorowania obiektowo-relacyjnego (ORM, Object-Relational Mapping).Funkcjonalność istniejących systemów ORM jest istotnie mniejsza niż dostępnych systemów zarządzania bazami danych (SZBD). Programista, który chce skorzystać z zaawansowanych funkcji SZBD, musi to zrobić z pominięciem warstwy ORM, co burzy architekturę aplikacji. Uważamy, że tak nie musi być.Celem niniejszej rozprawy doktorskiej jest zbadanie możliwości zaoferowania zaawansowanych funkcji systemów zarządzania bazami danych na poziomie warstwy odwzorowania obiektowo-relacyjnego. Cel ten został osiągnięty. Wykazaliśmy też, że ORM może realizować odpowiednią funkcjonalność nawet wtedy, gdy nie ma jej w użytkowanym SZBD. Zaawansowanąfunkcjonalnością SZBD rozważaną w niniejszej rozprawie jest realizacja zapytań rekurencyjnych zgodnych ze standardem SQL:1999. Przedstawiliśmy jej założenia, prototypową implementację oraz wyniki testów wydajnościowych.Do budowy prototypu wybrano Hibernate, tj. jedno z najpopularniejszych narzędzi ORM dla Javy.<br>Contemporary applications are developed in object-oriented programming languages.However, persistent data storage is usually realized by databases with the relational data model that significantly differs from the object-oriented data model.Therefore, persisting application data in a database requires a non-trivial mapping. Although such a mapping can be coded from scratch for a given application, the usage of off-the-shelf object-relational mapping (ORM) libraries is worth consideration.The functionality of existing ORM middleware is notably smaller than the functionality of available database management systems (DBMS). An application programmer who wants to use sophisticated features of a DBMS is forced to bypass the ORM layer.This obviously ruins the architecture of the application.In our opinion it is not necessary.The goal of this thesis is to examine the possibility to offer advanced functions of database management systems at the level of object-relational mapping middleware.This goal has been reached.We have also shown that ORM layers can also offer a particular DBMS functionality even when the underlying DBMS does not support it.The advanced DBMS functionality considered in this thesis is the execution of SQL:1999 recursive queries.We have presented the concept of this feature, a prototype implementation and results of thorough performance evaluation.The prototype has been realized as an extension to Hibernate, i.e.\ probably the most popular object-relational mapping library for Java.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "SQL recursive query"

1

Ghazal, Ahmad, Alain Crolotte, and Dawit Seid. "Recursive SQL Query Optimization with k-Iteration Lookahead." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11827405_34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Sikorski Andrzej and Ciemnoczolowski Yaroslav. "An Optimized Processing of Parent-Child Structural Join." In Frontiers in Artificial Intelligence and Applications. IOS Press, 2010. https://doi.org/10.3233/978-1-60750-477-1-253.

Full text
Abstract:
This paper provides a technique that enables embedding of path and twig query evaluation in an application server built on top of a small footprint data manager. The technique proposed offers increased flexibility, enabling seamless integration of business rules with low level evaluation facilities. This flexibility compares with that supported by stored procedures in SQL, not available for XML. Our method leverages deferred processing of a Structural Join (SJ) that we modify so as to achieve the minimum number of IO operations. Our recursive composition technique takes advantage of FIFO order processing, what results in a significant performance boost.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "SQL recursive query"

1

Zeng, Yu, Yan Gao, Jiaqi Guo, et al. "RECPARSER: A Recursive Semantic Parsing Framework for Text-to-SQL Task." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/504.

Full text
Abstract:
Neural semantic parsers usually fail to parse long and complicated utterances into nested SQL queries, due to the large search space. In this paper, we propose a novel recursive semantic parsing framework called RECPARSER to generate the nested SQL query layer-by-layer. It decomposes the complicated nested SQL query generation problem into several progressive non-nested SQL query generation problems. Furthermore, we propose a novel Question Decomposer module to explicitly encourage RECPARSER to focus on different components of an utterance when predicting SQL queries of different layers. Experiments on the Spider dataset show that our approach is more effective compared to the previous works at predicting the nested SQL queries. In addition, we achieve an overall accuracy that is comparable with state-of-the-art approaches.
APA, Harvard, Vancouver, ISO, and other styles
2

Cai, Ruichu, Boyan Xu, Zhenjie Zhang, Xiaoyan Yang, Zijian Li, and Zhihao Liang. "An Encoder-Decoder Framework Translating Natural Language to Database Queries." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/553.

Full text
Abstract:
Machine translation is going through a radical revolution, driven by the explosive development of deep learning techniques using Convolutional Neural Network (CNN) and Recurrent Neural Network (RNN). In this paper, we consider a special case in machine translation problems, targeting to convert natural language into Structured Query Language (SQL) for data retrieval over relational database. Although generic CNN and RNN learn the grammar structure of SQL when trained with sufficient samples, the accuracy and training efficiency of the model could be dramatically improved, when the translation model is deeply integrated with the grammar rules of SQL. We present a new encoder-decoder framework, with a suite of new approaches, including new semantic features fed into the encoder, grammar-aware states injected into the memory of decoder, as well as recursive state management for sub-queries. These techniques help the neural network better focus on understanding semantics of operations in natural language and save the efforts on SQL grammar learning. The empirical evaluation on real world database and queries show that our approach outperform state-of-the-art solution by a significant margin.
APA, Harvard, Vancouver, ISO, and other styles
3

Lutz, Carsten, and Leif Sabellek. "Ontology-Mediated Querying with the Description Logic EL: Trichotomy and Linear Datalog Rewritability." In Twenty-Sixth International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/164.

Full text
Abstract:
We consider ontology-mediated queries (OMQs) based on an EL ontology and an atomic query (AQ), provide an ultimately fine-grained analysis of data complexity and study rewritability into linear Datalog-aiming to capture linear recursion in SQL. Our main results are that every such OMQ is in AC0, NL-complete or PTime-complete, and that containment in NL coincides with rewritability into linear Datalog (whereas containment in AC0 coincides with rewritability into first-order logic). We establish natural characterizations of the three cases, show that deciding linear Datalog rewritability (as well as the mentioned complexities) is ExpTime-complete, give a way to construct linear Datalog rewritings when they exist, and prove that there is no constant bound on the arity of IDB relations in linear Datalog rewritings.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'SQL recursive query' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography