Cited By
View all- Cui XNiu DFeng J(2023)Cross-Modal Retrieval Based on Deep Hashing in the Context of Data SpaceCyber Security Intelligence and Analytics10.1007/978-3-031-31775-0_37(360-369)Online publication date: 30-Apr-2023
SQL-like query language and referential constraints on tree-structured data
Pages 1 - 10
Abstract
In this paper we investigate within-record referential constraints on tree-structured data. We consider an SQL-like query language such that the one used in Dremel and we call it tree-SQL. We show how to define and process a query in tree-SQL in the presence of referential constraints. We give the semantics of tree-SQL via flattening and show how to produce equivalent semantics using the notion of tree-expansion of a query in the presence of referential constraints.
References
[1]
Foto N. Afrati and Rada Chirkova. 2019. Answering Queries Using Views, Second Edition. Morgan & Claypool Publishers.
[2]
Foto N. Afrati and Matthew Damigos. 2021. Querying collections of tree-structured records in the presence of within-record referential constraints. In DEXA.
[3]
Foto N Afrati, Dan Delorey, Mosha Pasumansky, and Jeffrey D Ullman. 2014. Storing and querying tree-structured records in dremel. VLDB Endow. (2014).
[4]
Pierre Bourhis, Juan L. Reutter, Fernando Suárez, and Domagoj Vrgoc. 2017. JSON: Data model, Query languages and Schema specification. In PODS.
[5]
Peter Buneman, Susan B. Davidson, Wenfei Fan, Carmem S. Hara, and Wang Chiew Tan. 2002. Keys for XML. Comput. Networks (2002).
[6]
Peter Buneman, Susan B. Davidson, Wenfei Fan, Carmem S. Hara, and Wang Chiew Tan. 2003. Reasoning about keys for XML. Inf. Syst. (2003).
[7]
Diego Calvanese, Wolfgang Fischl, Reinhard Pichler, Emanuel Sallinger, and Mantas Simkus. 2014. Capturing Relational Schemas and Functional Dependencies in RDFS. In AAAI.
[8]
Latha S. Colby. 1989. A Recursive Algebra and Query Optimization for Nested Relations. In SIGMOD.
[9]
Alvaro Cortés-Calabuig and Jan Paredaens. 2012. Semantics of Constraints in RDFS. In AMW 2012.
[10]
Alin Deutsch, Mary F. Fernández, and Dan Suciu. 1999. Storing Semistructured Data with STORED. In SIGMOD.
[11]
Michael DiScala and Daniel J. Abadi. 2016. Automatic Generation of Normalized Relational Schemas from Nested Key-Value Data. In SIGMOD.
[12]
Wenfei Fan. 2005. XML Constraints: Specification, Analysis, and Applications. In DEXA.
[13]
Wenfei Fan, Zhe Fan, Chao Tian, and Xin Luna Dong. 2015. Keys for Graphs. VLDB Endow. (2015).
[14]
Wenfei Fan and Ping Lu. 2019. Dependencies for Graphs. ACM Trans. Database Syst.(2019).
[15]
Wenfei Fan and Jérôme Siméon. 2003. Integrity constraints for XML. J. Comput. Syst. Sci.(2003).
[16]
Wenfei Fan, Yinghui Wu, and Jingbo Xu. 2016. Functional Dependencies for Graphs. In SIGMOD.
[17]
Hector Garcia-Molina, Jeffrey D. Ullman, and Jennifer Widom. 2009. Database systems - the complete book (2. ed.). Pearson Education.
[18]
Jelle Hellings, Marc Gyssens, Jan Paredaens, and Yuqing Wu. 2016. Implication and axiomatization of functional and constant constraints. Ann. Math. Artif. Intell.(2016).
[19]
Georg Lausen, Michael Meier, and Michael Schmidt. 2008. SPARQLing constraints for RDF. In EDBT.
[20]
Zhen Hua Liu, Beda Christoph Hammerschmidt, and Douglas Mcmahon. 2014. JSON data management: supporting schema-less development in RDBMS. In SIGMOD.
[21]
Sergey Melnik, Andrey Gubarev, Jing Jing Long, Geoffrey Romer, Shiva Shivakumar, Matt Tolton, and Theo Vassilakis. 2010. Dremel: interactive analysis of web-scale datasets. VLDB Endow. (2010).
[22]
Sergey Melnik, Andrey Gubarev, Jing Jing Long, Geoffrey Romer, Shiva Shivakumar, Matt Tolton, Theo Vassilakis, Hossein Ahmadi, Dan Delorey, Slava Min, Mosha Pasumansky, and Jeff Shute. 2020. Dremel: A Decade of Interactive SQL Analysis at Web Scale. VLDB Endow. 13, 12 (2020), 3461–3472.
[23]
Jan Paredaens and Dirk Van Gucht. 1988. Possibilities and limitations of using flat operators in nested algebra expressions. In PODS.
[24]
Felipe Pezoa, Juan L. Reutter, Fernando Suárez, Martín Ugarte, and Domagoj Vrgoc. 2016. Foundations of JSON Schema. In WWW.
[25]
Fereidoon Sadri and Jeffrey D. Ullman. 1980. The Interaction between Functional Dependencies and Template Dependencies. In SIGMOD.
[26]
Marc H Scholl, H-Bernhard Paul, Hans-Jörg Schek, 1987. Supporting Flat Relations by a Nested Relational Kernel. In VLDB.
[27]
Jeff Shute, Radek Vingralek, Bart Samwel, Ben Handy, Chad Whipkey, Eric Rollins, Mircea Oancea, Kyle Littlefield, David Menestrina, Stephan Ellner, John Cieslewicz, Ian Rae, Traian Stancescu, and Himani Apte. 2013. F1: A Distributed SQL Database That Scales. VLDB Endow. (2013).
[28]
Loan T. H. Vo, Jinli Cao, and J. Wenny Rahayu. 2011. Discovering Conditional Functional Dependencies in XML Data. In ADC 2011.
[29]
Cong Yu and H. V. Jagadish. 2008. XML schema refinement through redundancy detection and normalization. VLDB J. (2008).
- SQL-like query language and referential constraints on tree-structured data
Recommendations
Processing queries on tree-structured data efficiently
PODS '06: Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systemsThis is a survey of algorithms, complexity results, and general solution techniques for efficiently processing queries on tree-structured data. I focus on query languages that compute nodes or tuples of nodes—conjunctive queries, first-order queries, ...
Implication and Referential Constraints: A New Formal Reasoning
In this paper, we address the issue of reasoning with two classes of commonly used semantic integrity constraints in database and knowledge-base systems: implication constraints and referential constraints. We first consider a central problem in this ...
Semantic querying of tree-structured data sources using partially specified tree patterns
CIKM '05: Proceedings of the 14th ACM international conference on Information and knowledge managementNowadays, huge volumes of data are organized or exported in a tree-structured form. Querying capabilities are provided through queries that are based on branching path expression. Even for a single knowledge domain structural differences raise ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
July 2021
308 pages
ISBN:9781450389914
DOI:10.1145/3472163
Copyright © 2021 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 07 September 2021
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
IDEAS 2021
IDEAS 2021: 25th International Database Engineering & Applications Symposium
July 14 - 16, 2021
QC, Montreal, Canada
Acceptance Rates
Overall Acceptance Rate 74 of 210 submissions, 35%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 70Total Downloads
- Downloads (Last 12 months)5
- Downloads (Last 6 weeks)0
Reflects downloads up to 03 Jan 2025
Other Metrics
Citations
Cited By
View all- Cui XNiu DFeng J(2023)Cross-Modal Retrieval Based on Deep Hashing in the Context of Data SpaceCyber Security Intelligence and Analytics10.1007/978-3-031-31775-0_37(360-369)Online publication date: 30-Apr-2023
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderHTML Format
View this article in HTML Format.
HTML Format