2009 | ||
---|---|---|
132 | George H. L. Fletcher, Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren: Towards a theory of search queries. ICDT 2009: 201-211 | |
131 | Dirk Leinders, Jan Van den Bussche: Repetitions and permutations of columns in the semijoin algebra. ITA 43(2): 179-187 (2009) | |
130 | Victor Vianu, Jan Van den Bussche: Introduction to PODS 2006 special section. J. ACM 56(3): (2009) | |
129 | 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) | |
2008 | ||
128 | Natalia Kwasnikowska, Jan Van den Bussche: Mapping the NRC Dataflow Model to the Open Provenance Model. IPAW 2008: 3-16 | |
127 | 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) | |
126 | Stefan Raeymaekers, Maurice Bruynooghe, Jan Van den Bussche: Learning ( k , l )-contextual tree languages for information extraction from web pages. Machine Learning 71(2-3): 155-183 (2008) | |
2007 | ||
125 | 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 | |
124 | Floris Geerts, Jan Van den Bussche: Relational Completeness of Query Languages for Annotated Databases. DBPL 2007: 127-137 | |
123 | Yuri Gurevich, Dirk Leinders, Jan Van den Bussche: A Theory of Stream Queries. DBPL 2007: 153-168 | |
122 | Jan Hidders, Natalia Kwasnikowska, Jacek Sroka, Jerzy Tyszkiewicz, Jan Van den Bussche: A Formal Model of Dataflow Repositories. DILS 2007: 105-121 | |
121 | 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 | |
120 | Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren: A crash course on database queries. PODS 2007: 143-154 | |
119 | Jan Van den Bussche, Stijn Vansummeren: Polymorphic type inference for the named nested relational calculus. ACM Trans. Comput. Log. 9(1): (2007) | |
118 | Jan Van den Bussche: Introduction to the PODS 2006 special section. ACM Trans. Database Syst. 32(4): (2007) | |
117 | Wim Janssen, Alexandr Korlyukov, Jan Van den Bussche: On the tree-transformation power of XSLT. Acta Inf. 43(6): 371-393 (2007) | |
116 | Jan Van den Bussche: Mining for trees in a graph is NP-complete CoRR abs/0709.4655: (2007) | |
115 | 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) | |
114 | 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) | |
2006 | ||
113 | Jan Van den Bussche: The Semijoin Algebra. FoIKS 2006: 1 | |
112 | Floris Geerts, Peter Z. Revesz, Jan Van den Bussche: On-line maintenance of simplified weighted graphs for efficient distance queries. GIS 2006: 203-210 | |
111 | Eveline Hoekx, Jan Van den Bussche: Mining for Tree-Query Associations in a Graph. ICDM 2006: 254-264 | |
110 | Wim Janssen, Alexandr Korlyukov, Jan Van den Bussche: On the tree-transformation power of XSLT CoRR abs/cs/0603028: (2006) | |
109 | Floris Geerts, Peter Z. Revesz, Jan Van den Bussche: On-line topological simplification of weighted graphs CoRR abs/cs/0608091: (2006) | |
108 | 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) | |
107 | 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) | |
106 | 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) | |
105 | Jan Van den Bussche: Database theory column: report on PODS 2006. SIGACT News 37(4): 56-57 (2006) | |
2005 | ||
104 | Bart Goethals, Eveline Hoekx, Jan Van den Bussche: Mining Tree Queries in a Graph. BNAIC 2005: 345-346 | |
103 | Stefan Raeymaekers, Maurice Bruynooghe, Jan Van den Bussche: Learning (k, l)-Contextual Tree Languages for Information Extraction. ECML 2005: 305-316 | |
102 | 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 | |
101 | Bart Goethals, Eveline Hoekx, Jan Van den Bussche: Mining tree queries in a graph. KDD 2005: 61-69 | |
100 | Jan Hidders, Natalia Kwasnikowska, Jacek Sroka, Jerzy Tyszkiewicz, Jan Van den Bussche: Petri Net + Nested Relational Calculus = Dataflow. OTM Conferences (1) 2005: 220-237 | |
99 | Dirk Leinders, Jan Van den Bussche: On the complexity of division and set joins in the relational algebra. PODS 2005: 76-83 | |
98 | 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) | |
97 | 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) | |
96 | Jan Van den Bussche: First-order Topology Properties. Bulletin of the EATCS 87: 155-164 (2005) | |
95 | Jan Van den Bussche, Stijn Vansummeren, Gottfried Vossen: Towards practical meta-querying. Inf. Syst. 30(4): 317-332 (2005) | |
94 | 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) | |
2004 | ||
93 | Jan Van den Bussche: Finite Cursor Machines in Database Query Processing. Abstract State Machines 2004: 61 | |
92 | Jan Van den Bussche, Stijn Vansummeren, Gottfried Vossen: Meta-SQL: Towards Practical Meta-Querying. EDBT 2004: 823-825 | |
91 | 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 | |
90 | Geert Jan Bex, Frank Neven, Jan Van den Bussche: DTDs versus XML Schema: A Practical Study. WebDB 2004: 79-84 | |
89 | 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) | |
88 | Dirk Leinders, Jerzy Tyszkiewicz, Jan Van den Bussche: The semijoin algebra and the guarded fragment CoRR cs.DB/0407007: (2004) | |
87 | Dirk Leinders, Jerzy Tyszkiewicz, Jan Van den Bussche: On the expressive power of semijoin queries. Inf. Process. Lett. 91(2): 93-98 (2004) | |
86 | Joachim Biskup, Jan Paredaens, Thomas Schwentick, Jan Van den Bussche: Solving Equations in the Relational Algebra. SIAM J. Comput. 33(5): 1052-1066 (2004) | |
2003 | ||
85 | Michal Bielecki, Jan Van den Bussche: Database Interrogation Using Conjunctive Queries. ICDT 2003: 259-269 | |
84 | 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 | |
83 | Dirk Leinders, Jerzy Tyszkiewicz, Jan Van den Bussche: On the expressive power of semijoin queries CoRR cs.DB/0308014: (2003) | |
82 | 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 | ||
81 | Michal Bielecki, Jan Hidders, Jan Paredaens, Jerzy Tyszkiewicz, Jan Van den Bussche: Navigating with a Browser. ICALP 2002: 764-775 | |
80 | Raymond Kosala, Jan Van den Bussche, Maurice Bruynooghe, Hendrik Blockeel: Information Extraction in Structured Documents Using Tree Automata Induction. PKDD 2002: 299-310 | |
79 | Marc Spielmann, Jerzy Tyszkiewicz, Jan Van den Bussche: Distributed Computation of Web Queries Using Automata. PODS 2002: 97-108 | |
78 | Bart Goethals, Jan Van den Bussche: Relational Association Rules: Getting WARMeR. Pattern Detection and Discovery 2002: 125-139 | |
77 | Jan Van den Bussche, Stijn Vansummeren, Gottfried Vossen: Towards practical meta-querying CoRR cs.DB/0202037: (2002) | |
76 | Bart Goethals, Jan Van den Bussche: Relational Association Rules: getting WARMeR CoRR cs.DB/0206023: (2002) | |
75 | Andreas Blass, Yuri Gurevich, Jan Van den Bussche: Abstract State Machines and Computationally Complete Query Languages. Inf. Comput. 174(1): 20-36 (2002) | |
74 | Frank Neven, Jan Van den Bussche: Expressiveness of structured document query languages based on attribute grammars. J. ACM 49(1): 56-100 (2002) | |
73 | Jan Van den Bussche, Emmanuel Waller: Polymorphic Type Inference for the Relational Algebra. J. Comput. Syst. Sci. 64(3): 694-718 (2002) | |
2001 | ||
72 | Jan Van den Bussche, Victor Vianu: Database Theory - ICDT 2001, 8th International Conference, London, UK, January 4-6, 2001, Proceedings. Springer 2001 | |
71 | Jan Van den Bussche: Applications of Alfred Tarski's Ideas in Database Theory. CSL 2001: 20-37 | |
70 | Floris Geerts, Bart Goethals, Jan Van den Bussche: A Tight Upper Bound on the Number of Candidate Patterns. ICDM 2001: 155-162 | |
69 | 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) | |
68 | Floris Geerts, Bart Goethals, Jan Van den Bussche: A Tight Upper Bound on the Number of Candidate Patterns CoRR cs.DB/0112007: (2001) | |
67 | Bart Goethals, Jan Van den Bussche: Interactive Constrained Association Rule Mining CoRR cs.DB/0112011: (2001) | |
66 | Joachim Biskup, Jan Paredaens, Thomas Schwentick, Jan Van den Bussche: Solving equations in the relational algebra CoRR cs.LO/0106034: (2001) | |
65 | Jan Van den Bussche, Emmanuel Waller: Polymorphic type inference for the relational algebra CoRR cs.LO/0106035: (2001) | |
64 | Frank Neven, Martin Otto, Jerzy Tyszkiewicz, Jan Van den Bussche: Adding For-Loops to First-Order Logic. Inf. Comput. 168(2): 156-186 (2001) | |
63 | Jan Van den Bussche: Rewriting queries using views over monadic database schemas. Inf. Process. Lett. 79(3): 111-114 (2001) | |
62 | 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) | |
2000 | ||
61 | Andreas Blass, Yuri Gurevich, Jan Van den Bussche: Abstract State Machines and Computationally Complete Query Languages. Abstract State Machines 2000: 22-33 | |
60 | Jan Van den Bussche: Constraint Databases, Queries, and Query Languages. Constraint Databases 2000: 20-54 | |
59 | Bart Goethals, Jan Van den Bussche: On Supporting Interactive Association Rule Mining. DaWaK 2000: 307-316 | |
58 | 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) | |
57 | Jan Van den Bussche: Constraint databases: A tutorial introduction. SIGMOD Record 29(3): 44-51 (2000) | |
1999 | ||
56 | 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 | |
55 | Bart Kuijpers, Jan Van den Bussche: On Capturing First-Order Topological Properties of Planar Spatial Databases. ICDT 1999: 187-198 | |
54 | Frank Neven, Martin Otto, Jerzy Tyszkiewicz, Jan Van den Bussche: Adding For-Loops to First-Order Logic. ICDT 1999: 58-69 | |
53 | Jan Van den Bussche, Emmanuel Waller: Type Inference in the Polymorphic Relational Algebra. PODS 1999: 80-90 | |
52 | 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) | |
51 | 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) | |
50 | Marc Gyssens, Jan Van den Bussche, Dirk Van Gucht: Complete Geometric Query Languages. J. Comput. Syst. Sci. 58(3): 483-511 (1999) | |
49 | 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) | |
1998 | ||
48 | Jan Van den Bussche, Emmanuel Waller: Methods and views. BDA 1998 | |
47 | Floris Geerts, Bart Kuijpers, Jan Van den Bussche: Topological Canonization of Planar Spatial Data and Its Incremental Maintenance. FMLDO 1998: 55-67 | |
46 | Frank Neven, Jan Van den Bussche: Expressiveness of Structured Document Query Languages Based on Attribute Grammars. PODS 1998: 11-17 | |
45 | Frank Neven, Jan Van den Bussche, Dirk Van Gucht, Gottfried Vossen: Typed Query Languages for Databases Containing Queries. PODS 1998: 189-196 | |
44 | Jan Van den Bussche, Luca Cabibbo: Converting Untyped Formulas to Typed Ones. Acta Inf. 35(8): 637-643 (1998) | |
43 | 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) | |
42 | 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) | |
1997 | ||
41 | Frank Neven, Jan Van den Bussche: On Implementing Structured Document Query Facilities on Top of a DOOD. DOOD 1997: 351-367 | |
40 | Bart Kuijpers, Jan Paredaens, Jan Van den Bussche: On Topological Elementary Equivalence of Spatial Databases. ICDT 1997: 432-446 | |
39 | Marc Gyssens, Jan Van den Bussche, Dirk Van Gucht: Complete Geometrical Query Languages. PODS 1997: 62-67 | |
38 | 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) | |
37 | 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) | |
1996 | ||
36 | Bart Kuijpers, Jan Paredaens, Marc Smits, Jan Van den Bussche: Termination Properties of Spatial Datalog Programs. Logic in Databases 1996: 101-116 | |
35 | Serge Abiteboul, Laurent Herr, Jan Van den Bussche: Temporal Versus First-Order Logic to Query Temporal Databases. PODS 1996: 49-57 | |
34 | Martin Otto, Jan Van den Bussche: First-Order Queries on Databases Embedded in an Infinite Structure. Inf. Process. Lett. 60(1): 37-41 (1996) | |
33 | Jan Van den Bussche, Dirk Van Gucht, Gottfried Vossen: Reflective Programming in the Relational Algebra. J. Comput. Syst. Sci. 52(3): 537-549 (1996) | |
1995 | ||
32 | Serge Abiteboul, Jan Van den Bussche: Deep Equality Revisited. DOOD 1995: 213-228 | |
31 | Jan Paredaens, Jan Van den Bussche, Dirk Van Gucht: First-order Queries on Finite Structures over the Reals LICS 1995: 79-87 | |
30 | Marc Andries, Luca Cabibbo, Jan Paredaens, Jan Van den Bussche: Applying an Update Method to a Set of Receivers. PODS 1995: 208-218 | |
29 | Bart Kuijpers, Jan Paredaens, Jan Van den Bussche: Lossless Representation of Topological Spatial Data. SSD 1995: 1-13 | |
28 | Serge Abiteboul, Laurent Herr, Jan Van den Bussche: Temporal Connectives versus Explicit Timestamps in Temporal Query Languages Temporal Databases 1995: 43-57 | |
27 | Jan Van den Bussche, Jan Paredaens: The Expressive Power of Complex Values in Object-Based Data Models Inf. Comput. 120(2): 220-236 (1995) | |
26 | 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) | |
1994 | ||
25 | Marc Gyssens, Jan Van den Bussche, Dirk Van Gucht: Expressiveness of Efficient Semi-Deterministic Choice Constructs. ICALP 1994: 106-117 | |
24 | Jan Paredaens, Jan Van den Bussche, Dirk Van Gucht: Towards a Theory of Spatial Database Queries. PODS 1994: 279-288 | |
23 | < |