default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJan Van den Bussche
Person information
- affiliation: Universiteit Hasselt, Belgium
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j90]Ana Pop Stefanija
, Bart Buelens, Elfi Goesaert, Tom Lenaerts, Jo Pierson, Jan Van den Bussche:
Toward a Solid Acceptance of the Decentralized Web of Personal Data: Societal and Technological Convergence. Commun. ACM 67(1): 43-46 (2024)- [j89]Bart Bogaerts, Maxime Jakubowski, Jan Van den Bussche:
Expressiveness of SHACL Features and Extensions for Full Equality and Disjointness Tests. Log. Methods Comput. Sci. 20(1) (2024) - [j88]Heba Aamer, Bart Bogaerts, Dimitri Surinx, Eugenia Ternovska, Jan Van den Bussche:
Executable First-Order Queries in the Logic of Information Flows. Log. Methods Comput. Sci. 20(2) (2024) - [j87]Bart Bogaerts, Balder ten Cate, Brett McLean, Jan Van den Bussche:
Preservation theorems for Tarski's relation algebra. Log. Methods Comput. Sci. 20(3) (2024) - [j86]Bart Bogaerts, Maxime Jakubowski, Jan Van den Bussche:
Postulates for Provenance: Instance-based provenance for first-order logic. Proc. ACM Manag. Data 2(2): 95 (2024) - [j85]Amir Aghasadeghi, Jan Van den Bussche, Julia Stoyanovich:
Temporal graph patterns by timed automata. VLDB J. 33(1): 25-47 (2024) - [c117]Martin Grohe, Jan Van den Bussche, Ke Yi:
The ACM PODS Alberto O. Mendelzon Test-of-Time Award 2024. PODS Companion 2024: 7 - [c116]Maxime Jakubowski, Jan Van den Bussche:
What's in a Neighborhood? Describing Nodes in RDF Graphs Using Shapes. RuleML+RR 2024: 1-13 - [i47]Martin Grohe, Christoph Standke, Juno Steegmans, Jan Van den Bussche:
Query languages for neural networks. CoRR abs/2408.10362 (2024) - [i46]Shqiponja Ahmetaj, Slawomir Staworko, Jan Van den Bussche, Maxime Jakubowski:
Shapes in Graph Data: Theory and Implementation (Dagstuhl Seminar 24102). Dagstuhl Reports 14(3): 9-30 (2024) - 2023
- [j84]Heba Aamer, Bart Bogaerts, Dimitri Surinx, Eugenia Ternovska, Jan Van den Bussche:
Inputs, Outputs, and Composition in the Logic of Information Flows. ACM Trans. Comput. Log. 24(4): 33:1-33:44 (2023) - [c115]Thomas Delva, Anastasia Dimou, Maxime Jakubowski, Jan Van den Bussche:
Data Provenance for SHACL. EDBT 2023: 285-297 - [c114]Jeroen Bollen, Jasper Steegmans, Jan Van den Bussche, Stijn Vansummeren:
Learning Graph Neural Networks using Exact Compression. GRADES-NDA@SIGMOD 2023: 8:1-8:9 - [c113]Jelle Hellings, Marc Gyssens, Jan Van den Bussche, Dirk Van Gucht:
Expressive Completeness of Two-Variable First-Order Logic with Counting for First-Order Logic Queries on Rooted Unranked Trees. LICS 2023: 1-13 - [c112]Maarten Vandenbrande, Maxime Jakubowski, Pieter Bonte, Bart Buelens, Femke Ongenae, Jan Van den Bussche:
POD-QUERY: Schema Mapping and Query Rewriting for Solid Pods. ISWC (Posters/Demos/Industry) 2023 - [i45]Jeroen Bollen, Jasper Steegmans, Jan Van den Bussche, Stijn Vansummeren:
Learning Graph Neural Networks using Exact Compression. CoRR abs/2304.14793 (2023) - [i44]Bart Bogaerts, Balder ten Cate, Brett McLean, Jan Van den Bussche:
Preservation theorems for Tarski's relation algebra. CoRR abs/2305.04656 (2023) - 2022
- [j83]Robert Brijder, Marc Gyssens, Jan Van den Bussche:
On matrices and K-relations. Ann. Math. Artif. Intell. 90(2-3): 181-210 (2022) - [c111]Heba Aamer, Marco Montali, Jan Van den Bussche:
What Can Database Query Processing Do for Instance-Spanning Constraints? Business Process Management Workshops 2022: 132-144 - [c110]Floris Geerts, Jasper Steegmans, Jan Van den Bussche:
On the Expressive Power of Message-Passing Neural Networks as Global Feature Map Transformers. FoIKS 2022: 20-34 - [c109]Bart Bogaerts, Maxime Jakubowski, Jan Van den Bussche:
Expressiveness of SHACL Features. ICDT 2022: 15:1-15:16 - [c108]Bart Bogaerts, Maxime Jakubowski, Jan Van den Bussche:
SHACL: A Description Logic in Disguise. LPNMR 2022: 75-88 - [i43]Floris Geerts, Jasper Steegmans, Jan Van den Bussche:
On the expressive power of message-passing neural networks as global feature map transformers. CoRR abs/2203.09555 (2022) - [i42]Amir Pouya Aghasadeghi, Jan Van den Bussche, Julia Stoyanovich:
Temporal graph patterns by timed automata. CoRR abs/2205.14269 (2022) - [i41]Heba Aamer, Marco Montali, Jan Van den Bussche:
What Can Database Query Processing Do for Instance-Spanning Constraints? CoRR abs/2206.00140 (2022) - [i40]Heba Aamer, Jan Hidders, Jan Paredaens, Jan Van den Bussche:
Expressiveness within Sequence Datalog. CoRR abs/2206.06754 (2022) - [i39]Heba Aamer, Bart Bogaerts, Dimitri Surinx, Eugenia Ternovska, Jan Van den Bussche:
Inputs, Outputs, and Composition in the Logic of Information Flows. CoRR abs/2209.06448 (2022) - [i38]Heba Aamer, Bart Bogaerts, Dimitri Surinx, Eugenia Ternovska, Jan Van den Bussche:
Executable First-Order Queries in the Logic of Information Flows. CoRR abs/2210.00240 (2022) - [i37]Bart Bogaerts, Maxime Jakubowski, Jan Van den Bussche:
Expressiveness of SHACL Features and Extensions for Full Equality and Disjointness Tests. CoRR abs/2212.03553 (2022) - 2021
- [j82]Steven Engels, Tony Tan, Jan Van den Bussche:
Subsequence versus substring constraints in sequence pattern languages. Acta Informatica 58(1-2): 35-56 (2021) - [j81]Flavio Ferrarotti, Senén González, José Maria Turull Torres, Jan Van den Bussche, Jonni Virtema:
Descriptive complexity of deterministic polylogarithmic time and space. J. Comput. Syst. Sci. 119: 145-163 (2021) - [j80]Robert Brijder, Joris J. M. Gillis, Jan Van den Bussche:
DNAQL: a query language for DNA sticker complexes. Nat. Comput. 20(1): 161-189 (2021) - [j79]Floris Geerts, Thomas Muñoz, Cristian Riveros, Jan Van den Bussche, Domagoj Vrgoc:
Matrix Query Languages. SIGMOD Rec. 50(3): 6-19 (2021) - [c107]Heba Aamer, Jan Van den Bussche:
Input-Output Disjointness for Forward Expressions in the Logic of Information Flows. ICDT 2021: 8:1-8:18 - [c106]Heba Aamer, Jan Hidders, Jan Paredaens, Jan Van den Bussche:
Expressiveness within Sequence Datalog. PODS 2021: 70-81 - [i36]Bart Bogaerts, Maxime Jakubowski, Jan Van den Bussche:
SHACL: A Description Logic in Disguise. CoRR abs/2108.06096 (2021) - [i35]Thomas Delva, Anastasia Dimou, Maxime Jakubowski, Jan Van den Bussche:
Shape Fragments. CoRR abs/2112.11796 (2021) - 2020
- [j78]Jelle Hellings, Marc Gyssens, Yuqing Wu, Dirk Van Gucht, Jan Van den Bussche, Stijn Vansummeren, George H. L. Fletcher:
Comparing the expressiveness of downward fragments of the relation algebra with transitive closure on trees. Inf. Syst. 89: 101467 (2020) - [c105]Xiaowang Zhang, Jan Van den Bussche, Kewen Wang, Heng Zhang, Xuanxing Yang, Zhiyong Feng:
On the Expressivity of ASK Queries in SPARQL. AAAI 2020: 3057-3064 - [c104]Robert Brijder, Marc Gyssens, Jan Van den Bussche:
On Matrices and K-Relations. FoIKS 2020: 42-57 - [c103]Heba Aamer, Bart Bogaerts, Dimitri Surinx, Eugenia Ternovska, Jan Van den Bussche:
Executable First-Order Queries in the Logic of Information Flows. ICDT 2020: 4:1-4:14 - [c102]Heba Aamer, Bart Bogaerts, Dimitri Surinx, Eugenia Ternovska, Jan Van den Bussche:
Inputs, Outputs, and Composition in the Logic of Information Flows. KR 2020: 2-11 - [c101]Miika Hannula, Juha Kontinen, Jan Van den Bussche, Jonni Virtema:
Descriptive complexity of real computation and probabilistic independence logic. LICS 2020: 550-563 - [c100]Georg Gottlob, Jan Van den Bussche, Dirk Van Gucht:
2020 ACM PODS Alberto O. Mendelzon Test-of-Time Award. PODS 2020: 17 - [i34]Miika Hannula, Juha Kontinen, Jan Van den Bussche, Jonni Virtema:
Descriptive complexity of real computation and probabilistic independence logic. CoRR abs/2003.00644 (2020) - [i33]Jan Hidders, Jan Paredaens, Jan Van den Bussche:
J-Logic: a Logic for Querying JSON. CoRR abs/2006.04277 (2020)
2010 – 2019
- 2019
- [j77]Dimitri Surinx, Jan Van den Bussche, Dirk Van Gucht:
A framework for comparing query languages in their ability to express boolean queries. Ann. Math. Artif. Intell. 87(1-2): 157-184 (2019) - [j76]Dimitri Surinx, Jan Van den Bussche:
A monotone preservation result for Boolean queries expressed as a containment of conjunctive queries. Inf. Process. Lett. 150: 1-5 (2019) - [j75]Robert Brijder, Floris Geerts, Jan Van den Bussche, Timmy Weerwag:
MATLANG: Matrix operations and their expressive power. SIGMOD Rec. 48(1): 60-67 (2019) - [j74]Robert Brijder, Floris Geerts, Jan Van den Bussche, Timmy Weerwag:
On the Expressive Power of Query Languages for Matrices. ACM Trans. Database Syst. 44(4): 15:1-15:31 (2019) - [c99]Gerald Berger, Martin Otto, Andreas Pieris, Dimitri Surinx, Jan Van den Bussche:
Additive First-Order Queries. ICDT 2019: 19:1-19:14 - [c98]Dimitri Surinx, Jan Van den Bussche, Jonni Virtema:
Fully Generic Queries: Open Problems and Some Partial Answers. MEDI 2019: 20-31 - [c97]Flavio Ferrarotti, Senén González, José Maria Turull Torres, Jan Van den Bussche, Jonni Virtema:
Descriptive Complexity of Deterministic Polylogarithmic Time. WoLLIC 2019: 208-222 - [i32]Flavio Ferrarotti, Senén González, José Maria Turull Torres, Jan Van den Bussche, Jonni Virtema:
Descriptive Complexity of Deterministic Polylogarithmic Time. CoRR abs/1903.03413 (2019) - [i31]Robert Brijder, Marc Gyssens, Jan Van den Bussche:
On matrices and K-relations. CoRR abs/1904.03934 (2019) - 2018
- [c96]Xiaowang Zhang, Jan Van den Bussche, Kewen Wang, Zhe Wang:
On the Satisfiability Problem of Patterns in SPARQL 1.1. AAAI 2018: 2054-2062 - [c95]Flavio Ferrarotti, Jan Van den Bussche, Jonni Virtema:
Expressivity Within Second-Order Transitive-Closure Logic. CSL 2018: 22:1-22:18 - [c94]Dimitri Surinx, Jan Van den Bussche, Dirk Van Gucht:
A Framework for Comparing Query Languages in Their Ability to Express Boolean Queries. FoIKS 2018: 360-378 - [c93]Robert Brijder, Floris Geerts, Jan Van den Bussche, Timmy Weerwag:
On the Expressive Power of Query Languages for Matrices. ICDT 2018: 10:1-10:17 - [e4]Jan Van den Bussche, Marcelo Arenas:
Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, Houston, TX, USA, June 10-15, 2018. ACM 2018 [contents] - [i30]Jelle Hellings, Marc Gyssens, Yuqing Wu, Dirk Van Gucht, Jan Van den Bussche, Stijn Vansummeren, George H. L. Fletcher:
Comparing Downward Fragments of the Relational Calculus with Transitive Closure on Trees. CoRR abs/1803.01390 (2018) - [i29]Flavio Ferrarotti, Jan Van den Bussche, Jonni Virtema:
Expressivity within second-order transitive-closure logic. CoRR abs/1804.05926 (2018) - [i28]Dimitri Surinx, Jan Van den Bussche:
A Monotone Preservation Result for Boolean Queries Expressed as a Containment of Conjunctive Queries. CoRR abs/1808.08822 (2018) - 2017
- [c92]Dimitri Surinx, Jan Van den Bussche, Dirk Van Gucht:
The primitivity of operators in the algebra of binary relations under conjunctions of containments. LICS 2017: 1-10 - [c91]Jan Hidders, Jan Paredaens, Jan Van den Bussche:
J-Logic: Logical Foundations for JSON Querying. PODS 2017: 137-149 - [e3]Emanuel Sallinger, Jan Van den Bussche, Floris Geerts:
Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2017, Chicago, IL, USA, May 14-19, 2017. ACM 2017, ISBN 978-1-4503-4198-1 [contents] - [i27]Robert Brijder, Floris Geerts, Jan Van den Bussche, Timmy Weerwag:
On the expressive power of query languages for matrices. CoRR abs/1709.08359 (2017) - 2016
- [j73]Xiaowang Zhang, Jan Van den Bussche, François Picalausa:
On the Satisfiability Problem for SPARQL Patterns. J. Artif. Intell. Res. 56: 403-428 (2016) - [j72]Tom J. Ameloot, Jan Van den Bussche, William R. Marczak, Peter Alvaro, Joseph M. Hellerstein:
Putting logic-based distributed systems on stable grounds. Theory Pract. Log. Program. 16(4): 378-417 (2016) - [j71]Angela Bonifati, Werner Nutt, Riccardo Torlone, Jan Van den Bussche:
Mapping-equivalence and oid-equivalence of single-function object-creating conjunctive queries. VLDB J. 25(3): 381-397 (2016) - [c90]Marcelo Arenas, Peter Buneman, Jan Van den Bussche:
2016 ACM PODS Alberto O. Mendelzon Test-of-Time Award. PODS 2016: 11 - [i26]Tom J. Ameloot, Jan Van den Bussche:
Learning with Value-Ramp. CoRR abs/1608.03647 (2016) - 2015
- [j70]George H. L. Fletcher, Marc Gyssens, Dirk Leinders, Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren, Yuqing Wu:
The impact of transitive closure on the expressiveness of navigational query languages on unlabeled graphs. Ann. Math. Artif. Intell. 73(1-2): 167-203 (2015) - [j69]Xiaowang Zhang, Jan Van den Bussche:
On the Power of SPARQL in Expressing Navigational Queries. Comput. J. 58(11): 2841-2851 (2015) - [j68]Dimitri Surinx, George H. L. Fletcher, Marc Gyssens, Dirk Leinders, Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren, Yuqing Wu:
Relative expressive power of navigational querying on graphs using transitive closure. Log. J. IGPL 23(5): 759-788 (2015) - [j67]George H. L. Fletcher, Marc Gyssens, Dirk Leinders, Dimitri Surinx, Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren, Yuqing Wu:
Relative expressive power of navigational querying on graphs. Inf. Sci. 298: 390-406 (2015) - [j66]Christophe Costa Florêncio, Jonny Daenen, Jan Ramon, Jan Van den Bussche, Dries Van Dyck:
Naive Infinite Enumeration of Context-free Languages in Incremental Polynomial Time. J. Univers. Comput. Sci. 21(7): 891-911 (2015) - [j65]George H. L. Fletcher, Marc Gyssens, Dirk Leinders, Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren:
Similarity and bisimilarity notions appropriate for characterizing indistinguishability in fragments of the calculus of relations. J. Log. Comput. 25(3): 549-580 (2015) - [j64]Tom J. Ameloot, Jan Van den Bussche:
Deciding Confluence for a Simple Class of Relational Transducer Networks. Theory Comput. Syst. 57(4): 1038-1111 (2015) - [j63]Tom J. Ameloot, Jan Van den Bussche:
Positive Neural Networks in Discrete Time Implement Monotone-Regular Behaviors. Neural Comput. 27(12): 2623-2660 (2015) - [j62]Natalia Kwasnikowska, Luc Moreau, Jan Van den Bussche:
A Formal Account of the Open Provenance Model. ACM Trans. Web 9(2): 10:1-10:44 (2015) - [c89]Jelle Hellings, Marc Gyssens, Yuqing Wu, Dirk Van Gucht, Jan Van den Bussche, Stijn Vansummeren, George H. L. Fletcher:
Relative expressive power of downward fragments of navigational query languages on trees and chains. DBPL 2015: 59-68 - [e2]Gustavo Alonso, Floris Geerts, Lucian Popa, Pablo Barceló, Jens Teubner, Martín Ugarte, Jan Van den Bussche, Jan Paredaens:
Proceedings of the 18th International Conference on Extending Database Technology, EDBT 2015, Brussels, Belgium, March 23-27, 2015. OpenProceedings.org 2015 [contents] - [i25]Angela Bonifati, Werner Nutt, Riccardo Torlone, Jan Van den Bussche:
Mapping-equivalence and oid-equivalence of single-function object-creating conjunctive queries. CoRR abs/1503.01707 (2015) - [i24]Tom J. Ameloot, Jan Van den Bussche, William R. Marczak, Peter Alvaro, Joseph M. Hellerstein:
Putting Logic-Based Distributed Systems on Stable Grounds. CoRR abs/1507.05539 (2015) - [i23]Tom J. Ameloot, Jan Van den Bussche:
Convergence in Navigational Reinforcement Learning. CoRR abs/1511.08724 (2015) - 2014
- [j61]Xiaowang Zhang, Guohui Xiao, Zuoquan Lin, Jan Van den Bussche:
Inconsistency-tolerant reasoning with OWL DL. Int. J. Approx. Reason. 55(2): 557-584 (2014) - [j60]Xiaowang Zhang, Jan Van den Bussche:
On the primitivity of operators in SPARQL. Inf. Process. Lett. 114(9): 480-485 (2014) - [j59]Tom J. Ameloot, Jan Van den Bussche:
Positive Dedalus programs tolerate non-causality. J. Comput. Syst. Sci. 80(7): 1191-1213 (2014) - [j58]Marcelo Arenas, Jonny Daenen, Frank Neven, Martín Ugarte, Jan Van den Bussche, Stijn Vansummeren:
Discovering XSD Keys from XML Data. ACM Trans. Database Syst. 39(4): 28:1-28:49 (2014) - [c88]Bart Bogaerts, Joost Vennekens, Marc Denecker, Jan Van den Bussche:
Inference in the FO(C) Modelling Language. ECAI 2014: 111-116 - [i22]George H. L. Fletcher, Marc Gyssens, Dirk Leinders, Dimitri Surinx, Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren, Yuqing Wu:
Relative Expressive Power of Navigational Querying on Graphs. CoRR abs/1401.8201 (2014) - [i21]Bart Bogaerts, Joost Vennekens, Marc Denecker, Jan Van den Bussche:
Inference in the FO(C) Modelling Language. CoRR abs/1404.6368 (2014) - [i20]Bart Bogaerts, Joost Vennekens, Marc Denecker, Jan Van den Bussche:
FO(C) and Related Modelling Paradigms. CoRR abs/1404.6394 (2014) - [i19]Bart Bogaerts, Joost Vennekens, Marc Denecker, Jan Van den Bussche:
FO(C): A Knowledge Representation Language of Causality. CoRR abs/1405.1833 (2014) - [i18]Tony Tan, Jan Van den Bussche, Xiaowang Zhang:
Undecidability of satisfiability in the algebra of finite binary relations with union, composition, and difference. CoRR abs/1406.0349 (2014) - [i17]Xiaowang Zhang, Jan Van den Bussche:
On the satisfiability problem for SPARQL patterns. CoRR abs/1406.1404 (2014) - 2013
- [j57]Jan Hidders, Paolo Missier, Jacek Sroka, Jan Van den Bussche:
Preface. Fundam. Informaticae 128(3) (2013) - [j56]Tom J. Ameloot, Frank Neven, Jan Van den Bussche:
Relational transducers for declarative networking. J. ACM 60(2): 15:1-15:38 (2013) - [j55]Robert Brijder, Joris J. M. Gillis, Jan Van den Bussche:
Graph-theoretic formalization of hybridization in DNA sticker complexes. Nat. Comput. 12(2): 223-234 (2013) - [c87]Xin Liang, Zuoquan Lin, Jan Van den Bussche:
Quantitatively Evaluating Formula-Variable Relevance by Forgetting. Canadian AI 2013: 271-277 - [c86]Natalia Kwasnikowska, Jan Van den Bussche:
Querying an Integrated Complex-Object Dataflow Database. In Search of Elegance in the Theory and Practice of Computation 2013: 400-417 - [c85]Jan Van den Bussche, Stijn Vansummeren:
Well-Defined NRC Queries Can Be Typed - (Extended Abstract). In Search of Elegance in the Theory and Practice of Computation 2013: 494-506 - [c84]Robert Brijder, Joris J. M. Gillis, Jan Van den Bussche:
The DNA query language DNAQL. ICDT 2013: 1-9 - [c83]Jelle Hellings, Bart Kuijpers, Jan Van den Bussche, Xiaowang Zhang:
Walk logic as a framework for path query languages on graph databases. ICDT 2013: 117-128 - [c82]Tom J. Ameloot, Jan Van den Bussche, Emmanuel Waller:
On the expressive power of update primitives. PODS 2013: 139-150 - [c81]Marcelo Arenas, Jonny Daenen, Frank Neven, Martín Ugarte, Jan Van den Bussche, Stijn Vansummeren:
Discovering XSD keys from XML data. SIGMOD Conference 2013: 61-72 - 2012
- [j54]Michal Bielecki, Jan Hidders, Jan Paredaens, Marc Spielmann, Jerzy Tyszkiewicz, Jan Van den Bussche:
The Navigational Power of Web Browsers. Theory Comput. Syst. 50(2): 213-240 (2012) - [j53]Robert Brijder, Joris J. M. Gillis, Jan Van den Bussche:
A comparison of graph-theoretic DNA hybridization models. Theor. Comput. Sci. 429: 46-53 (2012) - [c80]Tom J. Ameloot, Jan Van den Bussche:
On the CRON Conjecture. Datalog 2012: 44-55 - [c79]Robert Brijder, Joris J. M. Gillis, Jan Van den Bussche:
A Type System for DNAQL. DNA 2012: 12-24 - [c78]George H. L. Fletcher, Marc Gyssens, Dirk Leinders, Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren, Yuqing Wu:
The Impact of Transitive Closure on the Boolean Expressiveness of Navigational Query Languages on Graphs. FoIKS 2012: 124-143 - [c77]Tom J. Ameloot, Jan Van den Bussche:
Deciding eventual consistency for a simple class of relational transducer networks. ICDT 2012: 86-98 - [i16]George H. L. Fletcher, Marc Gyssens, Dirk Leinders, Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren:
Similarity and bisimilarity notions appropriate for characterizing indistinguishability in fragments of the calculus of relations. CoRR abs/1210.2688 (2012) - 2011
- [j52]Luc Moreau, Ben Clifford, Juliana Freire, Joe Futrelle, Yolanda Gil, Paul Groth, Natalia Kwasnikowska, Simon Miles, Paolo Missier, Jim Myers, Beth Plale, Yogesh Simmhan, Eric G. Stephan, Jan Van den Bussche:
The Open Provenance Model core specification (v1.1). Future Gener. Comput. Syst. 27(6): 743-756 (2011) - [j51]Floris Geerts, Jan Van den Bussche:
Relational completeness of query languages for annotated databases. J. Comput. Syst. Sci. 77(3): 491-504 (2011) - [c76]Robert Brijder, Joris J. M. Gillis, Jan Van den Bussche:
Graph-Theoretic Formalization of Hybridization in DNA Sticker Complexes. DNA 2011: 49-63 - [c75]George H. L. Fletcher, Marc Gyssens, Dirk Leinders, Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren, Yuqing Wu:
Relative expressive power of navigational querying on graphs. ICDT 2011: 197-207 - [c74]Joris J. M. Gillis, Jan Van den Bussche:
Expressive Power of Safe First-Order Logical Decision Trees. ILP 2011: 160-172 - [c73]Tom J. Ameloot, Frank Neven, Jan Van den Bussche:
Relational transducers for declarative networking. PODS 2011: 283-292 - [p2]Bart Kuijpers, Jan Van den Bussche:
Logical aspects of spatial databases. Finite and Algorithmic Model Theory 2011: 77-108 - 2010
- [j50]George H. L. Fletcher, Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren:
Towards a theory of search queries. ACM Trans. Database Syst. 35(4): 28:1-28:33 (2010) - [c72]Joris J. M. Gillis, Jan Van den Bussche:
A Formal Model for Databases in DNA. ANB 2010: 18-37 - [c71]Jan Van den Bussche:
Database Theory, Yuri, and Me. Fields of Logic and Computation 2010: 49-60 - [c70]Umut A. Acar, Peter Buneman, James Cheney, Jan Van den Bussche, Natalia Kwasnikowska, Stijn Vansummeren:
A Graph Model of Data and Workflow Provenance. TaPP 2010 - [i15]Eveline Hoekx, Jan Van den Bussche:
Mining tree-query associations in graphs. CoRR abs/1008.2626 (2010) - [i14]Tom J. Ameloot, Frank Neven, Jan Van den Bussche:
Relational transducers for declarative networking. CoRR abs/1012.2858 (2010)
2000 – 2009
- 2009
- [j49]Dirk Leinders, Jan Van den Bussche:
Repetitions and permutations of columns in the semijoin algebra. RAIRO Theor. Informatics Appl. 43(2): 179-187 (2009) - [j48]Victor Vianu, Jan Van den Bussche:
Introduction to PODS 2006 special section. J. ACM 56(3): 11:1 (2009) - [j47]Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole Schweikardt, Jerzy Tyszkiewicz, Jan Van den Bussche:
Database Query Processing Using Finite Cursor Machines. Theory Comput. Syst. 44(4): 533-560 (2009) - [c69]George H. L. Fletcher, Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren:
Towards a theory of search queries. ICDT 2009: 201-211 - [c68]Joris J. M. Gillis, Jan Van den Bussche:
Induction of Relational Algebra Expressions. ILP 2009: 25-33 - 2008
- [j46]Jan Hidders, Natalia Kwasnikowska, Jacek Sroka, Jerzy Tyszkiewicz, Jan Van den Bussche:
DFL: A dataflow language based on Petri nets and nested relational calculus. Inf. Syst. 33(3): 261-284 (2008) - [j45]Stefan Raeymaekers, Maurice Bruynooghe, Jan Van den Bussche:
Learning ( k , l )-contextual tree languages for information extraction from web pages. Mach. Learn. 71(2-3): 155-183 (2008) - [c67]Natalia Kwasnikowska, Jan Van den Bussche:
Mapping the NRC Dataflow Model to the Open Provenance Model. IPAW 2008: 3-16 - 2007
- [j44]Wim Janssen, Alexandr Korlyukov, Jan Van den Bussche:
On the tree-transformation power of XSLT. Acta Informatica 43(6): 371-393 (2007) - [j43]Dirk Leinders, Jan Van den Bussche:
On the complexity of division and set joins in the relational algebra. J. Comput. Syst. Sci. 73(4): 538-549 (2007) - [j42]Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren:
Well-definedness and semantic type-checking for the nested relational calculus. Theor. Comput. Sci. 371(3): 183-199 (2007) - [j41]Jan Van den Bussche, Stijn Vansummeren:
Polymorphic type inference for the named nested relational calculus. ACM Trans. Comput. Log. 9(1): 3 (2007) - [j40]Jan Van den Bussche:
Introduction to the PODS 2006 special section. ACM Trans. Database Syst. 32(4): 24 (2007) - [c66]Kerstin Koch, Stefan Schönauer, Ivy Jansen, Jan Van den Bussche, Tomasz Burzykowski:
Finding Clusters of Positive and Negative Coregulated Genes in Gene Expression Data. BIBE 2007: 93-99 - [c65]Floris Geerts, Jan Van den Bussche:
Relational Completeness of Query Languages for Annotated Databases. DBPL 2007: 127-137 - [c64]Yuri Gurevich, Dirk Leinders, Jan Van den Bussche:
A Theory of Stream Queries. DBPL 2007: 153-168 - [c63]Jan Hidders, Natalia Kwasnikowska, Jacek Sroka, Jerzy Tyszkiewicz, Jan Van den Bussche:
A Formal Model of Dataflow Repositories. DILS 2007: 105-121 - [c62]Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole Schweikardt, Jerzy Tyszkiewicz, Jan Van den Bussche:
Database Query Processing Using Finite Cursor Machines. ICDT 2007: 284-298 - [c61]Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren:
A crash course on database queries. PODS 2007: 143-154 - [i13]Jan Van den Bussche:
Mining for trees in a graph is NP-complete. CoRR abs/0709.4655 (2007) - 2006
- [j39]Raymond Kosala, Hendrik Blockeel, Maurice Bruynooghe, Jan Van den Bussche:
Information extraction from structured documents using k-testable tree automaton inference. Data Knowl. Eng. 58(2): 129-158 (2006) - [j38]Michael Benedikt, Bart Kuijpers, Christof Löding, Jan Van den Bussche, Thomas Wilke:
A characterization of first-order topological properties of planar spatial data. J. ACM 53(2): 273-305 (2006) - [j37]Floris Geerts, Bart Kuijpers, Jan Van den Bussche:
Linearization and Completeness Results for Terminating Transitive Closure Queries on Spatial Databases. SIAM J. Comput. 35(6): 1386-1439 (2006) - [j36]Jan Van den Bussche:
Database theory column: report on PODS 2006. SIGACT News 37(4): 56-57 (2006) - [c60]Jan Van den Bussche:
The Semijoin Algebra. FoIKS 2006: 1 - [c59]Floris Geerts, Peter Z. Revesz, Jan Van den Bussche:
On-line maintenance of simplified weighted graphs for efficient distance queries. GIS 2006: 203-210 - [c58]Eveline Hoekx, Jan Van den Bussche:
Mining for Tree-Query Associations in a Graph. ICDM 2006: 254-264 - [i12]Wim Janssen, Alexandr Korlyukov, Jan Van den Bussche:
On the tree-transformation power of XSLT. CoRR abs/cs/0603028 (2006) - [i11]Floris Geerts, Peter Z. Revesz, Jan Van den Bussche:
On-line topological simplification of weighted graphs. CoRR abs/cs/0608091 (2006) - 2005
- [j35]Floris Geerts, Lieven Smits, Jan Van den Bussche:
N-dimensional versus (N-1)-dimensional connectivity testing of first-order queries to semi-algebraic sets. Acta Informatica 42(1): 43-56 (2005) - [j34]Jan Van den Bussche:
First-order Topology Properties. Bull. EATCS 87: 155-164 (2005) - [j33]Jan Van den Bussche, Stijn Vansummeren, Gottfried Vossen:
Towards practical meta-querying. Inf. Syst. 30(4): 317-332 (2005) - [j32]Dirk Leinders, Maarten Marx, Jerzy Tyszkiewicz, Jan Van den Bussche:
The Semijoin Algebra and the Guarded Fragment. J. Log. Lang. Inf. 14(3): 331-343 (2005) - [j31]Floris Geerts, Bart Goethals, Jan Van den Bussche:
Tight upper bounds on the number of candidate patterns. ACM Trans. Database Syst. 30(2): 333-363 (2005) - [c57]Bart Goethals, Eveline Hoekx, Jan Van den Bussche:
Mining Tree Queries in a Graph. BNAIC 2005: 345-346 - [c56]Stefan Raeymaekers, Maurice Bruynooghe, Jan Van den Bussche:
Learning (k, l)-Contextual Tree Languages for Information Extraction. ECML 2005: 305-316 - [c55]Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren:
Well-Definedness and Semantic Type-Checking in the Nested Relational Calculus and XQuery Extended Abstract. ICDT 2005: 99-113 - [c54]Bart Goethals, Eveline Hoekx, Jan Van den Bussche:
Mining tree queries in a graph. KDD 2005: 61-69 - [c53]Jan Hidders, Natalia Kwasnikowska, Jacek Sroka, Jerzy Tyszkiewicz, Jan Van den Bussche:
Petri Net + Nested Relational Calculus = Dataflow. OTM Conferences (1) 2005: 220-237 - [c52]Dirk Leinders, Jan Van den Bussche:
On the complexity of division and set joins in the relational algebra. PODS 2005: 76-83 - 2004
- [j30]Dirk Leinders, Jerzy Tyszkiewicz, Jan Van den Bussche:
On the expressive power of semijoin queries. Inf. Process. Lett. 91(2): 93-98 (2004) - [j29]Joachim Biskup, Jan Paredaens, Thomas Schwentick, Jan Van den Bussche:
Solving Equations in the Relational Algebra. SIAM J. Comput. 33(5): 1052-1066 (2004) - [c51]Jan Van den Bussche:
Finite Cursor Machines in Database Query Processing. Abstract State Machines 2004: 61 - [c50]Jan Van den Bussche, Stijn Vansummeren, Gottfried Vossen:
Meta-SQL: Towards Practical Meta-Querying. EDBT 2004: 823-825 - [c49]Michael Benedikt, Christof Löding, Jan Van den Bussche, Thomas Wilke:
A Characterization of First-Order Topological Properties of Planar Spatial Data. PODS 2004: 107-114 - [c48]Geert Jan Bex, Frank Neven, Jan Van den Bussche:
DTDs versus XML Schema: A Practical Study. WebDB 2004: 79-84 - [i10]Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren:
Well-Definedness and Semantic Type-Checking in the Nested Relational Calculus and XQuery. CoRR cs.DB/0406060 (2004) - [i9]Dirk Leinders, Jerzy Tyszkiewicz, Jan Van den Bussche:
The semijoin algebra and the guarded fragment. CoRR cs.DB/0407007 (2004) - 2003
- [c47]Michal Bielecki, Jan Van den Bussche:
Database Interrogation Using Conjunctive Queries. ICDT 2003: 259-269 - [c46]Raymond Kosala, Maurice Bruynooghe, Jan Van den Bussche, Hendrik Blockeel:
Information Extraction from Web Documents Based on Local Unranked Tree Automaton Inference. IJCAI 2003: 403-408 - [i8]Dirk Leinders, Jerzy Tyszkiewicz, Jan Van den Bussche:
On the expressive power of semijoin queries. CoRR cs.DB/0308014 (2003) - [i7]Floris Geerts, Lieven Smits, Jan Van den Bussche:
Two- versus three-dimensional connectivity testing of first-order queries to semi-algebraic sets. CoRR cs.LO/0308001 (2003) - 2002
- [j28]Andreas Blass, Yuri Gurevich, Jan Van den Bussche:
Abstract State Machines and Computationally Complete Query Languages. Inf. Comput. 174(1): 20-36 (2002) - [j27]Frank Neven, Jan Van den Bussche:
Expressiveness of structured document query languages based on attribute grammars. J. ACM 49(1): 56-100 (2002) - [j26]Jan Van den Bussche, Emmanuel Waller:
Polymorphic Type Inference for the Relational Algebra. J. Comput. Syst. Sci. 64(3): 694-718 (2002) - [c45]Bart Goethals, Jan Van den Bussche:
Relational Association Rules: Getting WARMeR. Pattern Detection and Discovery 2002: 125-139 - [c44]Michal Bielecki, Jan Hidders, Jan Paredaens, Jerzy Tyszkiewicz, Jan Van den Bussche:
Navigating with a Browser. ICALP 2002: 764-775 - [c43]Raymond Kosala, Jan Van den Bussche, Maurice Bruynooghe, Hendrik Blockeel:
Information Extraction in Structured Documents Using Tree Automata Induction. PKDD 2002: 299-310 - [c42]Marc Spielmann, Jerzy Tyszkiewicz, Jan Van den Bussche:
Distributed Computation of Web Queries Using Automata. PODS 2002: 97-108 - [i6]Jan Van den Bussche, Stijn Vansummeren, Gottfried Vossen:
Towards practical meta-querying. CoRR cs.DB/0202037 (2002) - [i5]Bart Goethals, Jan Van den Bussche:
Relational Association Rules: getting WARMeR. CoRR cs.DB/0206023 (2002) - 2001
- [j25]Frank Neven, Martin Otto, Jerzy Tyszkiewicz, Jan Van den Bussche:
Adding For-Loops to First-Order Logic. Inf. Comput. 168(2): 156-186 (2001) - [j24]Jan Van den Bussche:
Rewriting queries using views over monadic database schemas. Inf. Process. Lett. 79(3): 111-114 (2001) - [j23]Jan Van den Bussche:
Simulation of the nested relational algebra by the flat relational algebra, with an application to the complexity of evaluating powerset algebra expressions. Theor. Comput. Sci. 254(1-2): 363-377 (2001) - [j22]Marc Andries, Luca Cabibbo, Jan Paredaens, Jan Van den Bussche:
Applying an update method to a set of receivers. ACM Trans. Database Syst. 26(1): 1-40 (2001) - [c41]Jan Van den Bussche:
Applications of Alfred Tarski's Ideas in Database Theory. CSL 2001: 20-37 - [c40]Floris Geerts, Bart Goethals, Jan Van den Bussche:
A Tight Upper Bound on the Number of Candidate Patterns. ICDM 2001: 155-162 - [e1]Jan Van den Bussche, Victor Vianu:
Database Theory - ICDT 2001, 8th International Conference, London, UK, January 4-6, 2001, Proceedings. Lecture Notes in Computer Science 1973, Springer 2001, ISBN 3-540-41456-8 [contents] - [i4]Floris Geerts, Bart Goethals, Jan Van den Bussche:
A Tight Upper Bound on the Number of Candidate Patterns. CoRR cs.DB/0112007 (2001) - [i3]Bart Goethals, Jan Van den Bussche:
Interactive Constrained Association Rule Mining. CoRR cs.DB/0112011 (2001) - [i2]Joachim Biskup, Jan Paredaens, Thomas Schwentick, Jan Van den Bussche:
Solving equations in the relational algebra. CoRR cs.LO/0106034 (2001) - [i1]Jan Van den Bussche, Emmanuel Waller:
Polymorphic type inference for the relational algebra. CoRR cs.LO/0106035 (2001) - 2000
- [j21]Bart Kuijpers, Jan Paredaens, Jan Van den Bussche:
Topological Elementary Equivalence of Closed Semi-Algebraic Sets in The Real Plane. J. Symb. Log. 65(4): 1530-1555 (2000) - [j20]Jan Van den Bussche:
Constraint databases: A tutorial introduction. SIGMOD Rec. 29(3): 44-51 (2000) - [c39]Andreas Blass, Yuri Gurevich, Jan Van den Bussche:
Abstract State Machines and Computationally Complete Query Languages. Abstract State Machines 2000: 22-33 - [c38]Bart Goethals, Jan Van den Bussche:
On Supporting Interactive Association Rule Mining. DaWaK 2000: 307-316 - [p1]Jan Van den Bussche:
Constraint Databases, Queries, and Query Languages. Constraint Databases 2000: 20-54
1990 – 1999
- 1999
- [j19]Frank Neven, Jan Van den Bussche, Dirk Van Gucht, Gottfried Vossen:
Typed Query Languages for Databases Containing Queries. Inf. Syst. 24(7): 569-595 (1999) - [j18]Serge Abiteboul, Laurent Herr, Jan Van den Bussche:
Temporal Connectives Versus Explicit Timestamps to Query Temporal Databases. J. Comput. Syst. Sci. 58(1): 54-68 (1999) - [j17]Marc Gyssens, Jan Van den Bussche, Dirk Van Gucht:
Complete Geometric Query Languages. J. Comput. Syst. Sci. 58(3): 483-511 (1999) - [j16]Kenneth A. Ross, Surajit Chaudhuri, Gösta Grahne, H. V. Jagadish, Jan Van den Bussche, Moshe Y. Vardi:
Reminiscences on Influential Papers. SIGMOD Rec. 28(4): 39-41 (1999) - [c37]Bart Goethals, Jan Van den Bussche:
A priori versus a posteriori filtering of association rules. 1999 ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery 1999 - [c36]Frank Neven, Martin Otto, Jerzy Tyszkiewicz, Jan Van den Bussche:
Adding For-Loops to First-Order Logic. ICDT 1999: 58-69 - [c35]Bart Kuijpers, Jan Van den Bussche:
On Capturing First-Order Topological Properties of Planar Spatial Databases. ICDT 1999: 187-198 - [c34]Jan Van den Bussche, Emmanuel Waller:
Type Inference in the Polymorphic Relational Algebra. PODS 1999: 80-90 - 1998
- [j15]Jan Van den Bussche, Luca Cabibbo:
Converting Untyped Formulas to Typed Ones. Acta Informatica 35(8): 637-643 (1998) - [j14]Marc Gemis, Jan Paredaens, Peter Peelman, Jan Van den Bussche:
Expressiveness and Complexity of Generic Graph Machines. Theory Comput. Syst. 31(3): 231-249 (1998) - [j13]Jan Paredaens, Jan Van den Bussche, Dirk Van Gucht:
First-Order Queries on Finite Structures Over the Reals. SIAM J. Comput. 27(6): 1747-1763 (1998) - [c33]Jan Van den Bussche, Emmanuel Waller:
Methods and views. BDA 1998 - [c32]Floris Geerts, Bart Kuijpers, Jan Van den Bussche:
Topological Canonization of Planar Spatial Data and Its Incremental Maintenance. FMLDO 1998: 55-67 - [c31]Frank Neven, Jan Van den Bussche:
Expressiveness of Structured Document Query Languages Based on Attribute Grammars. PODS 1998: 11-17 - [c30]Frank Neven, Jan Van den Bussche, Dirk Van Gucht, Gottfried Vossen:
Typed Query Languages for Databases Containing Queries. PODS 1998: 189-196 - 1997
- [j12]Jan Van den Bussche, Dirk Van Gucht, Marc Andries, Marc Gyssens:
On the completeness of object-creating database transformation languages. J. ACM 44(2): 272-319 (1997) - [j11]Jan Van den Bussche, Dirk Van Gucht:
A Semideterministic Approach to Object Creation and Nondeterminism in Database Queries. J. Comput. Syst. Sci. 54(1): 34-47 (1997) - [c29]Frank Neven, Jan Van den Bussche:
On Implementing Structured Document Query Facilities on Top of a DOOD. DOOD 1997: 351-367 - [c28]Bart Kuijpers, Jan Paredaens, Jan Van den Bussche:
On Topological Elementary Equivalence of Spatial Databases. ICDT 1997: 432-446 - [c27]Marc Gyssens, Jan Van den Bussche, Dirk Van Gucht:
Complete Geometrical Query Languages. PODS 1997: 62-67 - 1996
- [j10]Martin Otto, Jan Van den Bussche:
First-Order Queries on Databases Embedded in an Infinite Structure. Inf. Process. Lett. 60(1): 37-41 (1996) - [j9]Jan Van den Bussche, Dirk Van Gucht, Gottfried Vossen:
Reflective Programming in the Relational Algebra. J. Comput. Syst. Sci. 52(3): 537-549 (1996) - [c26]Bart Kuijpers, Jan Paredaens, Marc Smits, Jan Van den Bussche:
Termination Properties of Spatial Datalog Programs. Logic in Databases 1996: 101-116 - [c25]Serge Abiteboul, Laurent Herr, Jan Van den Bussche:
Temporal Versus First-Order Logic to Query Temporal Databases. PODS 1996: 49-57 - 1995
- [j8]Jan Van den Bussche, Jan Paredaens:
The Expressive Power of Complex Values in Object-Based Data Models. Inf. Comput. 120(2): 220-236 (1995) - [j7]Jan Van den Bussche, Dirk Van Gucht:
The Expressive Power of Cardinality-Bounded Set Values in Object-Based Data Models. Theor. Comput. Sci. 149(1): 49-66 (1995) - [c24]Serge Abiteboul, Jan Van den Bussche:
Deep Equality Revisited. DOOD 1995: 213-228 - [c23]Jan Paredaens, Jan Van den Bussche, Dirk Van Gucht:
First-order Queries on Finite Structures over the Reals. LICS 1995: 79-87 - [c22]Marc Andries, Luca Cabibbo, Jan Paredaens, Jan Van den Bussche:
Applying an Update Method to a Set of Receivers. PODS 1995: 208-218 - [c21]Bart Kuijpers, Jan Paredaens, Jan Van den Bussche:
Lossless Representation of Topological Spatial Data. SSD 1995: 1-13 - [c20]Serge Abiteboul, Laurent Herr, Jan Van den Bussche:
Temporal Connectives versus Explicit Timestamps in Temporal Query Languages. Temporal Databases 1995: 43-57 - 1994
- [j6]Marc Gyssens, Jan Paredaens, Jan Van den Bussche, Dirk Van Gucht:
A Graph-Oriented Object Database Model. IEEE Trans. Knowl. Data Eng. 6(4): 572-586 (1994) - [c19]Marc Gyssens, Jan Van den Bussche, Dirk Van Gucht:
Expressiveness of Efficient Semi-Deterministic Choice Constructs. ICALP 1994: 106-117 - [c18]Jan Paredaens, Jan Van den Bussche, Dirk Van Gucht:
Towards a Theory of Spatial Database Queries. PODS 1994: 279-288 - 1993
- [j5]Jan Van den Bussche:
On Minimizing the Forall-Not Degree of a Connective-Free Formula. Acta Informatica 30(5): 489-502 (1993) - [j4]Jan Van den Bussche:
Complex Object Multi-Level Fixpoint Queries. Ann. Math. Artif. Intell. 7(1-4): 41-62 (1993) - [j3]Jan Van den Bussche, Andreas Heuer:
Using SQL with object-oriented databases. Inf. Syst. 18(7): 461-487 (1993) - [c17]Marc Gemis, Jan Paredaens, Peter Peelman, Jan Van den Bussche:
A Computational Model for Generic Graph Functions. Dagstuhl Seminar on Graph Transformations in Computer Science 1993: 170-187 - [c16]Jan Van den Bussche, Gottfried Vossen:
An Extension of Path Expressions to Simplify Navigation in Object-Oriented Queries. DOOD 1993: 267-282 - [c15]Jan Van den Bussche, Dirk Van Gucht, Gottfried Vossen:
Reflective Programming in the Relational Algebra. PODS 1993: 17-25 - [c14]Marc Gemis, Jan Paredaens, Inge Thyssens, Jan Van den Bussche:
GOOD: AGraph-Oriented Object Database System. SIGMOD Conference 1993: 505-510 - 1992
- [j2]Jan Paredaens, Jan Van den Bussche, Marc Andries, Marc Gemis, Marc Gyssens, Inge Thyssens, Dirk Van Gucht, Vijay M. Sarathy, Lawrence V. Saxton:
An Overview of GOOD. SIGMOD Rec. 21(1): 25-31 (1992) - [c13]Marc Andries, Marc Gemis, Jan Paredaens, Inge Thyssens, Jan Van den Bussche:
Concepts for Graph-Oriented Object Manipulation. EDBT 1992: 21-38 - [c12]Jan Van den Bussche, Dirk Van Gucht:
Non-Deterministic Aspects of Object-Creating Database Transformations. FMLDO 1992: 3-16 - [c11]Jan Van den Bussche, Dirk Van Gucht, Marc Andries, Marc Gyssens:
On the Completeness of Object-Creating Query Languages (Extended Abstract). FOCS 1992: 372-379 - [c10]Marc Andries, Jan Paredaens, Jan Van den Bussche:
A Graph- and Object-Oriented Counterpart for SQL. Future Databases 1992: 276-285 - [c9]Jan Van den Bussche, Dirk Van Gucht:
A Hierarchy of Faithful Set Creation in Pure OODB's. ICDT 1992: 326-340 - [c8]Jan Van den Bussche, Dirk Van Gucht:
Semi-determinism. PODS 1992: 191-201 - 1991
- [c7]Jan Van den Bussche:
Evaluation and optimization of complex object selections. DOOD 1991: 226-243 - [c6]Jan Van den Bussche:
Active Complex Object Databases (Working Paper). FMLDO 1991: 103-113 - [c5]Jan Van den Bussche:
Complex Object Multi-Level Fixpoint Queries. MFDBS 1991: 1-13 - [c4]Jan Van den Bussche, Jan Paredaens:
The Expressive Power of Structured Values in Pure OODB's. PODS 1991: 291-299 - 1990
- [j1]Jan Van den Bussche:
A formal basis for extending SQL to object-oriented databases. Bull. EATCS 40: 207-216 (1990) - [c3]Andreas Heuer, Jan Van den Bussche:
Using SQL with Object-Oriented Databases (Preliminary Report). FMLDO 1990: 103-121
1980 – 1989
- 1989
- [c2]Jan Paredaens, Jan Van den Bussche:
TREES: A Graphical Model for Querying Hierarchical Databases. FMLDO 1989: 37-54 - [c1]Peter Sander, Simone Rehm, Jan Van den Bussche:
Working Group Report: Negation, Functions and Construction in Rule-Based Languages for Complex Objects. FMLDO 1989: 239-253
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-15 21:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
