| |
 |      |
                                               |
Note: Links lead to the DBLP on the Web. Jan Van den Bussche Jan Van den Bussche: The Semijoin Algebra. FoIKS 2006 : 1 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) Bart Goethals , Eveline Hoekx , Jan Van den Bussche: Mining Tree Queries in a Graph. BNAIC 2005 : 345-346 Stefan Raeymaekers , Maurice Bruynooghe , Jan Van den Bussche: Learning (k, l)-Contextual Tree Languages for Information Extraction. ECML 2005 : 305-316 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 Bart Goethals , Eveline Hoekx , Jan Van den Bussche: Mining tree queries in a graph. KDD 2005 : 61-69 Jan Hidders , Natalia Kwasnikowska , Jacek Sroka , Jerzy Tyszkiewicz , Jan Van den Bussche: Petri Net + Nested Relational Calculus = Dataflow. OTM Conferences (1) 2005 : 220-237 Dirk Leinders , Jan Van den Bussche: On the complexity of division and set joins in the relational algebra. PODS 2005 : 76-83 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) 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 Inf. 42 (1): 43-56 (2005) Jan Van den Bussche: First-order Topology Properties. Bulletin of the EATCS 87 : 155-164 (2005) Jan Van den Bussche, Stijn Vansummeren , Gottfried Vossen : Towards practical meta-querying. Inf. Syst. 30 (4): 317-332 (2005) Dirk Leinders , Maarten Marx , Jerzy Tyszkiewicz , Jan Van den Bussche: The Semijoin Algebra and the Guarded Fragment. Journal of Logic, Language and Information 14 (3): 331-343 (2005) Jan Van den Bussche: Finite Cursor Machines in Database Query Processing. Abstract State Machines 2004 : 61 Jan Van den Bussche, Stijn Vansummeren , Gottfried Vossen : Meta-SQL: Towards Practical Meta-Querying. EDBT 2004 : 823-825 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 Geert Jan Bex , Frank Neven , Jan Van den Bussche: DTDs versus XML Schema: A Practical Study. WebDB 2004 : 79-84 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) Dirk Leinders , Jerzy Tyszkiewicz , Jan Van den Bussche: The semijoin algebra and the guarded fragment CoRR cs.DB/0407007 : (2004) Dirk Leinders , Jerzy Tyszkiewicz , Jan Van den Bussche: On the expressive power of semijoin queries. Inf. Process. Lett. 91 (2): 93-98 (2004) Joachim Biskup , Jan Paredaens , Thomas Schwentick , Jan Van den Bussche: Solving Equations in the Relational Algebra. SIAM J. Comput. 33 (5): 1052-1066 (2004) Michal Bielecki , Jan Van den Bussche: Database Interrogation Using Conjunctive Queries. ICDT 2003 : 259-269 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 Dirk Leinders , Jerzy Tyszkiewicz , Jan Van den Bussche: On the expressive power of semijoin queries CoRR cs.DB/0308014 : (2003) 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) Michal Bielecki , Jan Hidders , Jan Paredaens , Jerzy Tyszkiewicz , Jan Van den Bussche: Navigating with a Browser. ICALP 2002 : 764-775 Raymond Kosala , Jan Van den Bussche, Maurice Bruynooghe , Hendrik Blockeel : Information Extraction in Structured Documents Using Tree Automata Induction. PKDD 2002 : 299-310 Marc Spielmann , Jerzy Tyszkiewicz , Jan Van den Bussche: Distributed Computation of Web Queries Using Automata. PODS 2002 : 97-108 Bart Goethals , Jan Van den Bussche: Relational Association Rules: Getting WARMeR. Pattern Detection and Discovery 2002 : 125-139 Jan Van den Bussche, Stijn Vansummeren , Gottfried Vossen : Towards practical meta-querying CoRR cs.DB/0202037 : (2002) Bart Goethals , Jan Van den Bussche: Relational Association Rules: getting WARMeR CoRR cs.DB/0206023 : (2002) Andreas Blass , Yuri Gurevich , Jan Van den Bussche: Abstract State Machines and Computationally Complete Query Languages. Inf. Comput. 174 (1): 20-36 (2002) Frank Neven , Jan Van den Bussche: Expressiveness of structured document query languages based on attribute grammars. J. ACM 49 (1): 56-100 (2002) Jan Van den Bussche, Emmanuel Waller : Polymorphic Type Inference for the Relational Algebra. J. Comput. Syst. Sci. 64 (3): 694-718 (2002) Jan Van den Bussche, Victor Vianu : Database Theory - ICDT 2001, 8th International Conference, London, UK, January 4-6, 2001, Proceedings. Springer 2001 Jan Van den Bussche: Applications of Alfred Tarski's Ideas in Database Theory. CSL 2001 : 20-37 Floris Geerts , Bart Goethals , Jan Van den Bussche: A Tight Upper Bound on the Number of Candidate Patterns. ICDM 2001 : 155-162 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) Floris Geerts , Bart Goethals , Jan Van den Bussche: A Tight Upper Bound on the Number of Candidate Patterns CoRR cs.DB/0112007 : (2001) Bart Goethals , Jan Van den Bussche: Interactive Constrained Association Rule Mining CoRR cs.DB/0112011 : (2001) Joachim Biskup , Jan Paredaens , Thomas Schwentick , Jan Van den Bussche: Solving equations in the relational algebra CoRR cs.LO/0106034 : (2001) Jan Van den Bussche, Emmanuel Waller : Polymorphic type inference for the relational algebra CoRR cs.LO/0106035 : (2001) Frank Neven , Martin Otto , Jerzy Tyszkiewicz , Jan Van den Bussche: Adding For-Loops to First-Order Logic. Inf. Comput. 168 (2): 156-186 (2001) Jan Van den Bussche: Rewriting queries using views over monadic database schemas. Inf. Process. Lett. 79 (3): 111-114 (2001) 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) Andreas Blass , Yuri Gurevich , Jan Van den Bussche: Abstract State Machines and Computationally Complete Query Languages. Abstract State Machines 2000 : 22-33 Jan Van den Bussche: Constraint Databases, Queries, and Query Languages. Constraint Databases 2000 : 20-54 Bart Goethals , Jan Van den Bussche: On Supporting Interactive Association Rule Mining. DaWaK 2000 : 307-316 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) Jan Van den Bussche: Constraint databases: A tutorial introduction. SIGMOD Record 29 (3): 44-51 (2000) 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 Bart Kuijpers , Jan Van den Bussche: On Capturing First-Order Topological Properties of Planar Spatial Databases. ICDT 1999 : 187-198 Frank Neven , Martin Otto , Jerzy Tyszkiewicz , Jan Van den Bussche: Adding For-Loops to First-Order Logic. ICDT 1999 : 58-69 Jan Van den Bussche, Emmanuel Waller : Type Inference in the Polymorphic Relational Algebra. PODS 1999 : 80-90 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) 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) Marc Gyssens , Jan Van den Bussche, Dirk Van Gucht : Complete Geometric Query Languages. J. Comput. Syst. Sci. 58 (3): 483-511 (1999) Kenneth A. Ross , Surajit Chaudhuri , Gösta Grahne , H. V. Jagadish , Jan Van den Bussche, Moshe Y. Vardi : Reminiscences on Influential Papers. SIGMOD Record 28 (4): 39-41 (1999) Floris Geerts , Bart Kuijpers , Jan Van den Bussche: Topological Canonization of Planar Spatial Data and Its Incremental Maintenance. FMLDO 1998 : 55-67 Frank Neven , Jan Van den Bussche: Expressiveness of Structured Document Query Languages Based on Attribute Grammars. PODS 1998 : 11-17 Frank Neven , Jan Van den Bussche, Dirk Van Gucht , Gottfried Vossen : Typed Query Languages for Databases Containing Queries. PODS 1998 : 189-196 Jan Van den Bussche, Luca Cabibbo : Converting Untyped Formulas to Typed Ones. Acta Inf. 35 (8): 637-643 (1998) 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) 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) Frank Neven , Jan Van den Bussche: On Implementing Structured Document Query Facilities on Top of a DOOD. DOOD 1997 : 351-367 Bart Kuijpers , Jan Paredaens , Jan Van den Bussche: On Topological Elementary Equivalence of Spatial Databases. ICDT 1997 : 432-446 Marc Gyssens , Jan Van den Bussche, Dirk Van Gucht : Complete Geometrical Query Languages. PODS 1997 : 62-67 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) 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) Bart Kuijpers , Jan Paredaens , Marc Smits , Jan Van den Bussche: Termination Properties of Spatial Datalog Programs. Logic in Databases 1996 : 101-116 Serge Abiteboul , Laurent Herr , Jan Van den Bussche: Temporal Versus First-Order Logic to Query Temporal Databases. PODS 1996 : 49-57 Martin Otto , Jan Van den Bussche: First-Order Queries on Databases Embedded in an Infinite Structure. Inf. Process. Lett. 60 (1): 37-41 (1996) Jan Van den Bussche, Dirk Van Gucht , Gottfried Vossen : Reflective Programming in the Relational Algebra. J. Comput. Syst. Sci. 52 (3): 537-549 (1996) Serge Abiteboul , Jan Van den Bussche: Deep Equality Revisited. DOOD 1995 : 213-228 Jan Paredaens , Jan Van den Bussche, Dirk Van Gucht : First-order Queries on Finite Structures over the Reals LICS 1995 : 79-87 Marc Andries , Luca Cabibbo , Jan Paredaens , Jan Van den Bussche: Applying an Update Method to a Set of Receivers. PODS 1995 : 208-218 Bart Kuijpers , Jan Paredaens , Jan Van den Bussche: Lossless Representation of Topological Spatial Data. SSD 1995 : 1-13 Serge Abiteboul , Laurent Herr , Jan Van den Bussche: Temporal Connectives versus Explicit Timestamps in Temporal Query Languages Temporal Databases 1995 : 43-57 Jan Van den Bussche, Jan Paredaens : The Expressive Power of Complex Values in Object-Based Data Models Inf. Comput. 120 (2): 220-236 (1995) 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) Marc Gyssens , Jan Van den Bussche, Dirk Van Gucht : Expressiveness of Efficient Semi-Deterministic Choice Constructs. ICALP 1994 : 106-117 Jan Paredaens , Jan Van den Bussche, Dirk Van Gucht : Towards a Theory of Spatial Database Queries. PODS 1994 : 279-288 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) Jan Van den Bussche, Gottfried Vossen : An Extension of Path Expressions to Simplify Navigation in Object-Oriented Queries. DOOD 1993 : 267-282 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 Jan Van den Bussche, Dirk Van Gucht , Gottfried Vossen : Reflective Programming in the Relational Algebra. PODS 1993 : 17-25 Marc Gemis , Jan Paredaens , Inge Thyssens , Jan Van den Bussche: GOOD: AGraph-Oriented Object Database System. SIGMOD Conference 1993 : 505-510 Jan Van den Bussche: On Minimizing the Forall-Not Degree of a Connective-Free Formula. Acta Inf. 30 (5): 489-502 (1993) Jan Van den Bussche: Complex Object Multi-Level Fixpoint Queries. Ann. Math. Artif. Intell. 7 (1-4): 41-62 (1993) Jan Van den Bussche, Andreas Heuer : Using SQL with object-oriented databases. Inf. Syst. 18 (7): 461-487 (1993) Marc Andries , Marc Gemis , Jan Paredaens , Inge Thyssens , Jan Van den Bussche: Concepts for Graph-Oriented Object Manipulation. EDBT 1992 : 21-38 Jan Van den Bussche, Dirk Van Gucht : Non-Deterministic Aspects of Object-Creating Database Transformations. FMLDO 1992 : 3-16 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 Marc Andries , Jan Paredaens , Jan Van den Bussche: A Graph- and Object-Oriented Counterpart for SQL. Future Databases 1992 : 276-285 Jan Van den Bussche, Dirk Van Gucht : A Hierarchy of Faithful Set Creation in Pure OODB's. ICDT 1992 : 326-340 Jan Van den Bussche, Dirk Van Gucht : Semi-determinism. PODS 1992 : 191-201 Jan Paredaens , Jan Van den Bussche, Marc Andries , Marc Gemis , Marc Gyssens , Inge Thyssens , Dirk Van Gucht , Vijay Sarathy , Lawrence V. Saxton : An Overview of GOOD. SIGMOD Record 21 (1): 25-31 (1992) Jan Van den Bussche: Evaluation and optimization of complex object selections. DOOD 1991 : 226-243 Jan Van den Bussche: Active Complex Object Databases (Working Paper). FMLDO 1991 : 103-113 Jan Van den Bussche: Complex Object Multi-Level Fixpoint Queries. MFDBS 1991 : 1-13 Jan Van den Bussche, Jan Paredaens : The Expressive Power of Structured Values in Pure OODB's. PODS 1991 : 291-299 Andreas Heuer , Jan Van den Bussche: Using SQL with Object-Oriented Databases (Preliminary Report). FMLDO 1990 : 103-121 Jan Van den Bussche: A formal basis for extending SQL to object-oriented databases. Bulletin of the EATCS 40 : 207-216 (1990) 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 Jan Paredaens , Jan Van den Bussche: TREES: A Graphical Model for Querying Hierarchical Databases. FMLDO 1989 : 37-54 1 [ 28 ] [ 32 ] [ 35 ] [ 50 ] 2 [ 9 ] [ 12 ] [ 13 ] [ 15 ] [ 30 ] [ 38 ] [ 68 ] 3 [ 90 ] 4 [ 89 ] 5 [ 80 ] [ 84 ] 6 [ 65 ] [ 85 ] 7 [ 60 ] [ 74 ] 8 [ 79 ] [ 83 ] 9 [ 79 ] [ 83 ] [ 102 ] 10 [ 30 ] [ 44 ] [ 68 ] 11 [ 48 ] 12 [ 47 ] [ 67 ] [ 69 ] [ 81 ] [ 96 ] [ 97 ] [ 104 ] 13 [ 9 ] [ 15 ] [ 19 ] [ 21 ] [ 42 ] 14 [ 55 ] [ 58 ] [ 66 ] [ 67 ] [ 69 ] [ 75 ] [ 77 ] [ 97 ] [ 100 ] [ 103 ] 15 [ 48 ] 16 [ 9 ] [ 10 ] [ 11 ] [ 13 ] [ 14 ] [ 20 ] [ 23 ] [ 24 ] [ 25 ] [ 26 ] [ 31 ] [ 33 ] [ 37 ] [ 38 ] [ 39 ] [ 43 ] [ 45 ] [ 49 ] [ 51 ] [ 88 ] [ 101 ] 17 [ 60 ] [ 74 ] 18 [ 9 ] [ 13 ] [ 23 ] [ 25 ] [ 38 ] [ 39 ] [ 49 ] 19 [ 28 ] [ 35 ] [ 50 ] 20 [ 4 ] [ 16 ] 21 [ 80 ] [ 99 ] 22 [ 100 ] [ 103 ] 23 [ 48 ] 24 [ 79 ] [ 83 ] 25 [ 29 ] [ 36 ] [ 40 ] [ 47 ] [ 54 ] [ 57 ] [ 104 ] 26 [ 99 ] 27 [ 82 ] [ 86 ] [ 87 ] [ 93 ] [ 98 ] 28 [ 90 ] 29 [ 93 ] 30 [ 41 ] [ 45 ] [ 46 ] [ 51 ] [ 53 ] [ 63 ] [ 73 ] [ 89 ] 31 [ 34 ] [ 53 ] [ 63 ] 32 [ 1 ] [ 5 ] [ 9 ] [ 12 ] [ 15 ] [ 19 ] [ 21 ] [ 23 ] [ 24 ] [ 27 ] [ 29 ] [ 30 ] [ 31 ] [ 36 ] [ 40 ] [ 42 ] [ 43 ] [ 57 ] [ 65 ] [ 68 ] [ 80 ] [ 85 ] 33 [ 21 ] [ 42 ] 34 [ 102 ] 35 [ 2 ] 36 [ 48 ] 37 [ 2 ] 38 [ 9 ] 39 [ 9 ] 40 [ 65 ] [ 85 ] 41 [ 81 ] [ 96 ] 42 [ 36 ] 43 [ 78 ] 44 [ 99 ] 45 [ 9 ] [ 15 ] [ 19 ] 46 [ 53 ] [ 63 ] [ 78 ] [ 80 ] [ 82 ] [ 86 ] [ 87 ] [ 93 ] [ 99 ] 47 [ 76 ] [ 88 ] [ 91 ] [ 94 ] [ 101 ] 48 [ 48 ] 49 [ 71 ] 50 [ 20 ] [ 22 ] [ 33 ] [ 45 ] [ 51 ] [ 76 ] [ 91 ] [ 94 ] 51 [ 52 ] [ 64 ] [ 72 ] 52 [ 90 ]  ©2006 Association for Computing Machinery |
