default search action
Frank Neven
Person information
- affiliation: Hasselt University, Diepenbeek, Belgium
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2024
- [j58]Brecht Vandevoort
, Bas Ketsman
When View- and Conflict-Robustness Coincide for Multiversion Concurrency Control. Proc. ACM Manag. Data 2(2): 91 (2024) - [j57]Brecht Vandevoort, Bas Ketsman
Allocating Isolation Levels to Transactions in a Multiversion Setting. SIGMOD Rec. 53(1): 16-23 (2024) - 2023
- [j56]Brecht Vandevoort, Bas Ketsman
Robustness against Read Committed for Transaction Templates with Functional Constraints. Log. Methods Comput. Sci. 19(4) (2023) - [j55]Niels Bylois, Frank Neven, Stijn Vansummeren:
CM-Explorer: Dissecting Data Ingestion Problems. Proc. VLDB Endow. 16(12): 3958-3961 (2023) - [j54]Brecht Vandevoort, Bas Ketsman
When is it safe to run a transactional workload under Read Committed? SIGMOD Rec. 52(1): 36-43 (2023) - 2022
- [j53]Bas Ketsman
Concurrency control for database theorists. SIGMOD Rec. 51(4): 6-17 (2022) - [j52]Bas Ketsman
Deciding Robustness for Lower SQL Isolation Levels. ACM Trans. Database Syst. 47(4): 13:1-13:41 (2022) - 2021
- [j51]Brecht Vandevoort
Robustness against Read Committed for Transaction Templates. Proc. VLDB Endow. 14(11): 2141-2153 (2021) - 2019
- [j50]Gaetano Geck
Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation. ACM Trans. Comput. Log. 20(3): 18:1-18:24 (2019) - 2018
- [j49]Serge Abiteboul, Marcelo Arenas, Pablo Barceló, Meghyn Bienvenu
Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151). Dagstuhl Manifestos 7(1): 1-29 (2018) - [j48]Frank Neven
Finite-State Map-Reduce Computation and Relational Algebra Queries. ACM Trans. Comput. Log. 19(2): 14:1-14:37 (2018) - 2017
- [j47]Tom J. Ameloot, Gaetano Geck
Reasoning on data partitioning for single-round multi-join evaluation in massively parallel systems. Commun. ACM 60(3): 93-100 (2017) - [j46]Tom J. Ameloot, Gaetano Geck
Parallel-Correctness and Transferability for Conjunctive Queries. J. ACM 64(5): 36:1-36:38 (2017) - [j45]Bas Ketsman
Optimal Broadcasting Strategies for Conjunctive Queries over Distributed Data. Theory Comput. Syst. 61(1): 233-260 (2017) - [j44]Tom J. Ameloot, Bas Ketsman
Datalog Queries Distributing over Components. ACM Trans. Comput. Log. 18(1): 5:1-5:35 (2017) - [j43]Wim Martens, Frank Neven
BonXai: Combining the Simplicity of DTD with the Expressiveness of XML Schema. ACM Trans. Database Syst. 42(3): 15:1-15:42 (2017) - 2016
- [j42]Jonny Daenen, Frank Neven
Parallel Evaluation of Multi-Semi-Joins. Proc. VLDB Endow. 9(10): 732-743 (2016) - [j41]Tom J. Ameloot, Gaetano Geck
Data partitioning for single-round multi-join evaluation in massively parallel systems. SIGMOD Rec. 45(1): 33-40 (2016) - [j40]Serge Abiteboul, Marcelo Arenas, Pablo Barceló, Meghyn Bienvenu, Diego Calvanese, Claire David, Richard Hull, Eyke Hüllermeier, Benny Kimelfeld, Leonid Libkin
Research Directions for Principles of Data Management (Abridged). SIGMOD Rec. 45(4): 5-17 (2016) - [j39]Tom J. Ameloot, Bas Ketsman
Weaker Forms of Monotonicity for Declarative Networking: A More Fine-Grained Answer to the CALM-Conjecture. ACM Trans. Database Syst. 40(4): 21:1-21:45 (2016) - 2015
- [j38]Timos Antonopoulos, Dag Hovland
Deciding Twig-definability of Node Selecting Tree Automata. Theory Comput. Syst. 57(4): 967-1007 (2015) - 2014
- [j37]Marcelo Arenas, Jonny Daenen, Frank Neven
Discovering XSD Keys from XML Data. ACM Trans. Database Syst. 39(4): 28:1-28:49 (2014) - 2013
- [j36]Tom J. Ameloot, Frank Neven
Relational transducers for declarative networking. J. ACM 60(2): 15:1-15:38 (2013) - [j35]Wouter Gelade, Tomasz Idziaszek, Wim Martens, Frank Neven
Simplifying XML Schema: Single-type approximations of regular tree languages. J. Comput. Syst. Sci. 79(6): 910-936 (2013) - [j34]Timos Antonopoulos, Floris Geerts
Generating, Sampling and Counting Subclasses of Regular Tree Languages. Theory Comput. Syst. 52(3): 542-585 (2013) - [j33]Wenfei Fan, Floris Geerts
Making Queries Tractable on Big Data with Preprocessing. Proc. VLDB Endow. 6(9): 685-696 (2013) - [j32]Peter Boyen, Frank Neven
Mining Minimal Motif Pair Sets Maximally Covering Interactions in a Protein-Protein Interaction Network. IEEE ACM Trans. Comput. Biol. Bioinform. 10(1): 73-86 (2013) - 2012
- [j31]Wim Martens, Frank Neven
Developing and Analyzing XSDs through BonXai. Proc. VLDB Endow. 5(12): 1994-1997 (2012) - [j30]Wouter Gelade, Frank Neven
Succinctness of the Complement and Intersection of Regular Expressions. ACM Trans. Comput. Log. 13(1): 4:1-4:19 (2012) - 2011
- [j29]Wouter Gelade, Frank Neven
Succinctness of pattern-based schema languages for XML. J. Comput. Syst. Sci. 77(3): 505-519 (2011) - [j28]Tom J. Ameloot, Maarten Marx
30 Years of PODS in facts and figures. SIGMOD Rec. 40(3): 54-60 (2011) - [j27]Peter Boyen, Dries Van Dyck, Frank Neven
SLIDER: A Generic Metaheuristic for the Discovery of Correlated Motifs in Protein-Protein Interaction Networks. IEEE ACM Trans. Comput. Biol. Bioinform. 8(5): 1344-1357 (2011) - 2010
- [j26]Wouter Gelade, Frank Neven
Optimizing the Region Algebra is PSPACE-complete. Inf. Process. Lett. 110(16): 639-643 (2010) - [j25]Geert Jan Bex, Frank Neven
Inference of concise regular expressions and DTDs. ACM Trans. Database Syst. 35(2): 11:1-11:47 (2010) - [j24]Geert Jan Bex, Wouter Gelade, Frank Neven
Learning Deterministic Regular Expressions for the Inference of Schemas from XML Data. ACM Trans. Web 4(4): 14:1-14:32 (2010) - 2009
- [j23]Wouter Gelade, Wim Martens, Frank Neven
Optimizing Schema Languages for XML: Numerical Constraints and Interleaving. SIAM J. Comput. 38(5): 2021-2043 (2009) - [j22]Wim Martens, Frank Neven, Thomas Schwentick:
Complexity of Decision Problems for XML Schemas and Chain Regular Expressions. SIAM J. Comput. 39(4): 1486-1530 (2009) - 2008
- [j21]Wim Martens, Frank Neven
Typechecking top-down XML transformations: Fixed input or output schemas. Inf. Comput. 206(7): 806-827 (2008) - [j20]Anastasios Kementsietsidis, Frank Neven
Scalable multi-query optimization for exploratory queries over federated scientific databases. Proc. VLDB Endow. 1(1): 16-27 (2008) - [j19]Wenfei Fan
Expressiveness and complexity of XML publishing transducers. ACM Trans. Database Syst. 33(4): 25:1-25:49 (2008) - 2007
- [j18]Wim Martens, Frank Neven
Frontiers of tractability for typechecking simple XML transformations. J. Comput. Syst. Sci. 73(3): 362-390 (2007) - [j17]Wim Martens, Frank Neven
Simple off the shelf abstractions for XML schema. SIGMOD Rec. 36(3): 15-22 (2007) - [j16]Michael Benedikt
Logical definability and query languages over ranked and unranked trees. ACM Trans. Comput. Log. 8(2): 11 (2007) - 2006
- [j15]Frank Neven
On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. Log. Methods Comput. Sci. 2(3) (2006) - [j14]Wim Martens, Frank Neven
Expressiveness and complexity of XML Schema. ACM Trans. Database Syst. 31(3): 770-813 (2006) - 2005
- [j13]Frank Neven
Attribute grammars for unranked trees as a query language for structured documents. J. Comput. Syst. Sci. 70(2): 221-257 (2005) - [j12]Wim Martens, Frank Neven
On the complexity of typechecking top-down XML transformations. Theor. Comput. Sci. 336(1): 153-180 (2005) - 2004
- [j11]Frank Neven
Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Log. 5(3): 403-435 (2004) - 2003
- [j10]Frank Neven, Thomas Schwentick:
On the power of tree-walking automata. Inf. Comput. 183(1): 86-103 (2003) - [j9]Noga Alon, Tova Milo, Frank Neven
XML with data values: typechecking revisited. J. Comput. Syst. Sci. 66(4): 688-727 (2003) - [j8]Kenneth A. Ross, Frank Neven, Beng Chin Ooi:
Reminiscences on Influential Papers. SIGMOD Rec. 32(2): 89 (2003) - [j7]Noga Alon, Tova Milo, Frank Neven
Typechecking XML views of relational databases. ACM Trans. Comput. Log. 4(3): 315-354 (2003) - 2002
- [j6]Geert Jan Bex, Sebastian Maneth, Frank Neven
A formal model for an expressive fragment of XSLT. Inf. Syst. 27(1): 21-39 (2002) - [j5]Frank Neven
Expressiveness of structured document query languages based on attribute grammars. J. ACM 49(1): 56-100 (2002) - [j4]Frank Neven
Automata Theory for XML Researchers. SIGMOD Rec. 31(3): 39-46 (2002) - [j3]Frank Neven
Query automata over finite trees. Theor. Comput. Sci. 275(1-2): 633-674 (2002) - 2001
- [j2]Frank Neven
Adding For-Loops to First-Order Logic. Inf. Comput. 168(2): 156-186 (2001) - 1999
- [j1]Frank Neven
Typed Query Languages for Databases Containing Queries. Inf. Syst. 24(7): 569-595 (1999)
Conference and Workshop Papers
- 2024
- [c75]Marcel Parciak, Sebastiaan Weytjens, Niel Hens, Frank Neven, Liesbet M. Peeters, Stijn Vansummeren:
Measuring Approximate Functional Dependencies: A Comparative Study. ICDE 2024: 3505-3518 - [c74]Marcel Parciak, Brecht Vandevoort, Frank Neven, Liesbet M. Peeters, Stijn Vansummeren:
Schema Matching with Large Language Models: an Experimental Study. VLDB Workshops 2024 - 2023
- [c73]Niels Bylois
Data Ingestion Validation through Stable Conditional Metrics with Ranking and Filtering. ADBIS 2023: 210-223 - [c72]Brecht Vandevoort, Bas Ketsman
Detecting Robustness against MVRC for Transaction Programs with Predicate Reads. EDBT 2023: 565-577 - [c71]Marcelo Arenas
The ACM PODS Alberto O. Mendelzon Test-of-Time Award 2023. PODS 2023: 3-4 - [c70]Brecht Vandevoort
Allocating Isolation Levels to Transactions in a Multiversion Setting. PODS 2023: 69-78 - 2022
- [c69]Brecht Vandevoort
Robustness Against Read Committed for Transaction Templates with Functional Constraints. ICDT 2022: 16:1-16:17 - [c68]Brecht Vandevoort
Robustness Against Read Committed: A Free Transactional Lunch. PODS 2022: 1-14 - 2020
- [c67]Gaetano Geck
Distribution Constraints: The Chase for Distributed Data. ICDT 2020: 13:1-13:19 - [c66]Bas Ketsman
Deciding Robustness for Lower SQL Isolation Levels. PODS 2020: 315-330 - 2019
- [c65]Frank Neven
Parallel-Correctness and Parallel-Boundedness for Datalog Programs. ICDT 2019: 14:1-14:19 - [c64]Johannes Doleschal, Benny Kimelfeld, Wim Martens, Yoav Nahshon
Split-Correctness in Information Extraction. PODS 2019: 149-163 - 2018
- [c63]Johannes Doleschal, Wim Martens, Frank Neven
Satisfiability for SCULPT-Schemas for CSV-Like Data. ICDT 2018: 14:1-14:19 - [c62]Bas Ketsman
Parallel-Correctness and Transferability for Conjunctive Queries under Bag Semantics. ICDT 2018: 18:1-18:16 - [c61]Johannes Doleschal, Nico Höllerich
Chisel: Sculpting Tabular and Non-Tabular Data on the Web. WWW (Companion Volume) 2018: 139-142 - 2016
- [c60]Gaetano Geck
Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation. ICDT 2016: 9:1-9:17 - [c59]Frank Neven
Logical Aspects of Massively Parallel and Distributed Systems. PODS 2016: 303-314 - 2015
- [c58]Jonny Daenen, Frank Neven
Gumbo: Guarded Fragment Queries over Big Data. EDBT 2015: 521-524 - [c57]Bas Ketsman
Optimal Broadcasting Strategies for Conjunctive Queries over Distributed Data. ICDT 2015: 291-307 - [c56]Tom J. Ameloot, Bas Ketsman
Datalog Queries Distributing over Components. ICDT 2015: 308-323 - [c55]Frank Neven
Distributed Streaming with Finite Memory. ICDT 2015: 324-341 - [c54]Foto N. Afrati, Frank Neven
The ACM PODS Alberto O. Mendelzon Test-of-Time Award 2015. PODS 2015: 45 - [c53]Tom J. Ameloot, Gaetano Geck
Parallel-Correctness and Transferability for Conjunctive Queries. PODS 2015: 47-58 - [c52]Wim Martens, Frank Neven
BonXai: Combining the simplicity of DTD with the expressiveness of XML Schema. PODS 2015: 145-156 - [c51]Wim Martens, Frank Neven
SCULPT: A Schema Language for Tabular Data on the Web. WWW 2015: 702-720 - 2014
- [c50]Frank Neven:
Remaining CALM in Declarative Networking. ICDT 2014: 1 - [c49]Tom J. Ameloot, Bas Ketsman
Weaker forms of monotonicity for declarative networking: a more fine-grained answer to the calm-conjecture. PODS 2014: 64-75 - 2013
- [c48]Timos Antonopoulos, Frank Neven
Definability problems for graph query languages. ICDT 2013: 141-152 - [c47]Marcelo Arenas, Jonny Daenen, Frank Neven
Discovering XSD keys from XML data. SIGMOD Conference 2013: 61-72 - 2012
- [c46]Timos Antonopoulos, Dag Hovland
Deciding twig-definability of node selecting tree automata. ICDT 2012: 61-73 - 2011
- [c45]Timos Antonopoulos, Floris Geerts
Generating, sampling and counting subclasses of regular tree languages. ICDT 2011: 30-41 - [c44]Timos Antonopoulos, Wim Martens, Frank Neven
The complexity of text-preserving XML transformations. PODS 2011: 247-258 - [c43]Tom J. Ameloot, Frank Neven
Relational transducers for declarative networking. PODS 2011: 283-292 - 2010
- [c42]Wouter Gelade, Tomasz Idziaszek, Wim Martens, Frank Neven
Simplifying XML schema: single-type approximations of regular tree languages. PODS 2010: 251-260 - 2009
- [c41]Peter Boyen, Frank Neven
SLIDER: Mining Correlated Motifs in Protein-Protein Interaction Networks. ICDM 2009: 716-721 - [c40]Geert Jan Bex, Wouter Gelade, Wim Martens, Frank Neven
Simplifying XML schema: effortless handling of nondeterministic regular expressions. SIGMOD Conference 2009: 731-744 - 2008
- [c39]Wim Martens, Frank Neven, Thomas Schwentick:
Deterministic top-down tree automata: past, present, and future. Logic and Automata 2008: 505-530 - [c38]Anastasios Kementsietsidis, Frank Neven
BioScout: a life-science query monitoring system. EDBT 2008: 730-734 - [c37]Wenfei Fan
Complexity and composition of synthesized web services. PODS 2008: 231-240 - [c36]Geert Jan Bex, Frank Neven
SchemaScope: a system for inferring and cleaning XML schemas. SIGMOD Conference 2008: 1259-1262 - [c35]Wouter Gelade, Frank Neven:
Succinctness of the Complement and Intersection of Regular Expressions. STACS 2008: 325-336 - [c34]Geert Jan Bex, Wouter Gelade, Frank Neven
Learning deterministic regular expressions for the inference of schemas from XML data. WWW 2008: 825-834 - 2007
- [c33]Wouter Gelade, Frank Neven
Succinctness of Pattern-Based Schema Languages for XML. DBPL 2007: 201-215 - [c32]Wouter Gelade, Wim Martens, Frank Neven
Optimizing Schema Languages for XML: Numerical Constraints and Interleaving. ICDT 2007: 269-283 - [c31]Wenfei Fan
Expressiveness and complexity of xml publishing transducers. PODS 2007: 83-92 - [c30]Geert Jan Bex, Frank Neven, Stijn Vansummeren:
Inferring XML Schema Definitions from XML Data. VLDB 2007: 998-1009 - 2006
- [c29]Dieter Van de Craen, Frank Neven
An Extensible Light-Weight XML-Based Monitoring System for Sequence Databases. DILS 2006: 280-296 - [c28]Frank Neven
Optimizing Monitoring Queries over Distributed Data. EDBT 2006: 829-846 - [c27]Geert Jan Bex, Frank Neven, Thomas Schwentick, Karl Tuyls:
Inference of Concise DTDs from XML Data. VLDB 2006: 115-126 - 2005
- [c26]Wim Martens, Frank Neven
Which XML Schemas Admit 1-Pass Preorder Typing? ICDT 2005: 68-82 - [c25]Geert Jan Bex, Wim Martens, Frank Neven, Thomas Schwentick:
Expressiveness of XSDs: from practice to theory, there and back again. WWW 2005: 712-721 - 2004
- [c24]Wim Martens, Frank Neven
Complexity of Decision Problems for Simple Regular Expressions. MFCS 2004: 889-900 - [c23]Wim Martens, Frank Neven
Frontiers of Tractability for Typechecking Simple XML Transformations. PODS 2004: 23-34 - [c22]Geert Jan Bex, Frank Neven
DTDs versus XML Schema: A Practical Study. WebDB 2004: 79-84 - 2003
- [c21]Wim Martens, Frank Neven
Typechecking Top-Down Uniform Unranked Tree Transducers. ICDT 2003: 64-78 - [c20]Frank Neven
XPath Containment in the Presence of Disjunction, DTDs, and Variables. ICDT 2003: 312-326 - [c19]Leonid Libkin, Frank Neven:
Logical Definability and Query Languages over Unranked Trees. LICS 2003: 178-187 - 2002
- [c18]Frank Neven
Automata, Logic, and XML. CSL 2002: 2-26 - [c17]Frank Neven
On the Power of Walking for Querying Tree-Structured Data. PODS 2002: 77-84 - 2001
- [c16]Noga Alon, Tova Milo, Frank Neven
Typechecking XML Views of Relational Databases. LICS 2001: 421-430 - [c15]Frank Neven
Towards Regular Languages over Infinite Alphabets. MFCS 2001: 560-572 - [c14]Noga Alon, Tova Milo, Frank Neven, Dan Suciu, Victor Vianu:
XML with Data Values: Typechecking Revisited. PODS 2001 - [c13]Frank Neven
Automata-and Logic-Based Pattern Languages for Tree-Structured Data. Semantics in Databases 2001: 160-178 - 2000
- [c12]Geert Jan Bex, Sebastian Maneth, Frank Neven
A Formal Model for an Expressive Fragment of XSLT. Computational Logic 2000: 1137-1151 - [c11]Frank Neven
On the Power of Tree-Walking Automata. ICALP 2000: 547-560 - [c10]Frank Neven, Thomas Schwentick:
Expressive and Efficient Pattern Languages for Tree-Structured Data. PODS 2000: 145-156 - 1999
- [c9]Sebastian Maneth, Frank Neven
Structured Document Transformations Based on XSL. DBPL 1999: 80-98 - [c8]Frank Neven
Extensions of Attribute Grammars for Structured Document Queries. DBPL 1999: 99-116 - [c7]Frank Neven, Thomas Schwentick:
Automata for Unary Queries on Trees. Grundlagen von Datenbanken 1999: 102-106 - [c6]Frank Neven, Martin Otto, Jerzy Tyszkiewicz, Jan Van den Bussche:
Adding For-Loops to First-Order Logic. ICDT 1999: 58-69 - [c5]Frank Neven
Query Automata. PODS 1999: 205-214 - 1998
- [c4]Frank Neven:
Structured Document Query Languages Based on Attribute Grammars: Locality and Non-Determinism. FMLDO 1998: 129-142 - [c3]Frank Neven
Expressiveness of Structured Document Query Languages Based on Attribute Grammars. PODS 1998: 11-17 - [c2]Frank Neven
Typed Query Languages for Databases Containing Queries. PODS 1998: 189-196 - 1997
- [c1]Frank Neven
On Implementing Structured Document Query Facilities on Top of a DOOD. DOOD 1997: 351-367
Editorship
- 2005
- [e3]Frank Neven, Thomas Schwentick, Dan Suciu:
Foundations of Semistructured Data, 6.-11. February 2005. Dagstuhl Seminar Proceedings 05061, IBFI, Schloss Dagstuhl, Germany 2005 [contents] - [e2]AnHai Doan, Frank Neven, Robert McCann, Geert Jan Bex:
Proceedings of the Eight International Workshop on the Web & Databases (WebDB 2005), Baltimore, Maryland, USA, Collocated mith ACM SIGMOD/PODS 2005, June 16-17, 2005. 2005 [contents] - 2003
- [e1]Frank Neven, Catriel Beeri, Tova Milo:
Proceedings of the Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 9-12, 2003, San Diego, CA, USA. ACM 2003, ISBN 1-58113-670-6 [contents]
Reference Works
- 2018
- [r2]Frank Neven:
XML Types. Encyclopedia of Database Systems (2nd ed.) 2018 - 2009
- [r1]Frank Neven:
XML Types. Encyclopedia of Database Systems 2009: 3650-3654
Informal and Other Publications
- 2024
- [i20]Brecht Vandevoort, Bas Ketsman, Frank Neven:
When View- and Conflict-Robustness Coincide for Multiversion Concurrency Control. CoRR abs/2403.17665 (2024) - [i19]Marcel Parciak, Brecht Vandevoort, Frank Neven, Liesbet M. Peeters, Stijn Vansummeren:
Schema Matching with Large Language Models: an Experimental Study. CoRR abs/2407.11852 (2024) - 2023
- [i18]Brecht Vandevoort, Bas Ketsman, Christoph Koch, Frank Neven:
Detecting Robustness against MVRC for Transaction Programs with Predicate Reads. CoRR abs/2302.08789 (2023) - [i17]Marcel Parciak
Measuring Approximate Functional Dependencies: a Comparative Study. CoRR abs/2312.06296 (2023) - 2022
- [i16]Brecht Vandevoort, Bas Ketsman, Christoph Koch, Frank Neven:
Robustness against Read Committed for Transaction Templates with Functional Constraints. CoRR abs/2201.05021 (2022) - 2021
- [i15]Brecht Vandevoort, Bas Ketsman, Christoph Koch, Frank Neven:
Robustness against Read Committed for Transaction Templates. CoRR abs/2107.12239 (2021) - 2020
- [i14]Gaetano Geck, Frank Neven, Thomas Schwentick:
Distribution Constraints: The Chase for Distributed Data. CoRR abs/2003.00965 (2020) - 2018
- [i13]Johannes Doleschal, Benny Kimelfeld, Wim Martens, Yoav Nahshon, Frank Neven:
Split-Correctness in Information Extraction. CoRR abs/1810.03367 (2018) - 2017
- [i12]Serge Abiteboul, Marcelo Arenas, Pablo Barceló, Meghyn Bienvenu, Diego Calvanese, Claire David, Richard Hull, Eyke Hüllermeier, Benny Kimelfeld, Leonid Libkin, Wim Martens, Tova Milo, Filip Murlak, Frank Neven, Magdalena Ortiz, Thomas Schwentick, Julia Stoyanovich, Jianwen Su, Dan Suciu, Victor Vianu, Ke Yi:
Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151). CoRR abs/1701.09007 (2017) - 2016
- [i11]Jonny Daenen, Frank Neven, Tony Tan, Stijn Vansummeren:
Parallel Evaluation of Multi-Semi-Joins. CoRR abs/1605.05219 (2016) - 2015
- [i10]Gaetano Geck, Bas Ketsman, Frank Neven, Thomas Schwentick:
Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation. CoRR abs/1512.06246 (2015) - 2014
- [i9]Wim Martens, Frank Neven, Stijn Vansummeren:
SCULPT: A Schema Language for Tabular Data on the Web. CoRR abs/1411.2351 (2014) - [i8]Tom J. Ameloot, Gaetano Geck, Bas Ketsman, Frank Neven, Thomas Schwentick:
Parallel-Correctness and Transferability for Conjunctive Queries. CoRR abs/1412.4030 (2014) - 2010
- [i7]Geert Jan Bex, Wouter Gelade, Frank Neven, Stijn Vansummeren:
Learning Deterministic Regular Expressions for the Inference of Schemas from XML Data. CoRR abs/1004.2372 (2010) - [i6]Tom J. Ameloot, Frank Neven, Jan Van den Bussche:
Relational transducers for declarative networking. CoRR abs/1012.2858 (2010) - 2008
- [i5]Wouter Gelade, Frank Neven:
Succinctness of the Complement and Intersection of Regular Expressions. CoRR abs/0802.2869 (2008) - 2006
- [i4]Frank Neven, Thomas Schwentick:
On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. CoRR abs/cs/0606065 (2006) - [i3]Wim Martens, Frank Neven, Marc Gyssens:
On Typechecking Top-Down XML Tranformations: Fixed Input or Output Schemas. CoRR abs/cs/0606094 (2006) - 2005
- [i2]Frank Neven, Thomas Schwentick, Dan Suciu:
05061 Abstracts Collection - Foundations of Semistructured Data. Foundations of Semistructured Data 2005 - [i1]Frank Neven, Thomas Schwentick, Dan Suciu:
05061 Summary - Foundations of Semi-structured Data. Foundations of Semistructured Data 2005
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-11-08 21:30 CET 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: