Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrank Neven
- > Home > Persons > Frank Neven
Publications
- 2020
[c67]Gaetano Geck
, Frank Neven, Thomas Schwentick:
Distribution Constraints: The Chase for Distributed Data. ICDT 2020: 13:1-13:19- [i14]Gaetano Geck, Frank Neven, Thomas Schwentick:
Distribution Constraints: The Chase for Distributed Data. CoRR abs/2003.00965 (2020) - 2019
- [j50]Gaetano Geck, Bas Ketsman, Frank Neven, Thomas Schwentick:
Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation. ACM Trans. Comput. Log. 20(3): 18:1-18:24 (2019) - [c65]Frank Neven, Thomas Schwentick, Christopher Spinrath, Brecht Vandevoort:
Parallel-Correctness and Parallel-Boundedness for Datalog Programs. ICDT 2019: 14:1-14:19 - 2018
- [j49]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). Dagstuhl Manifestos 7(1): 1-29 (2018) - 2017
- [j47]Tom J. Ameloot, Gaetano Geck, Bas Ketsman, Frank Neven, Thomas Schwentick:
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, Bas Ketsman, Frank Neven, Thomas Schwentick:
Parallel-Correctness and Transferability for Conjunctive Queries. J. ACM 64(5): 36:1-36:38 (2017) - [j43]Wim Martens, Frank Neven, Matthias Niewerth, Thomas Schwentick:
BonXai: Combining the Simplicity of DTD with the Expressiveness of XML Schema. ACM Trans. Database Syst. 42(3): 15:1-15:42 (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
- [j41]Tom J. Ameloot, Gaetano Geck, Bas Ketsman, Frank Neven, Thomas Schwentick:
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, 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 (Abridged). SIGMOD Rec. 45(4): 5-17 (2016) - [c60]Gaetano Geck, Bas Ketsman, Frank Neven, Thomas Schwentick:
Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation. ICDT 2016: 9:1-9:17 - 2015
- [c53]Tom J. Ameloot, Gaetano Geck, Bas Ketsman, Frank Neven, Thomas Schwentick:
Parallel-Correctness and Transferability for Conjunctive Queries. PODS 2015: 47-58 - [c52]Wim Martens, Frank Neven, Matthias Niewerth, Thomas Schwentick:
BonXai: Combining the simplicity of DTD with the expressiveness of XML Schema. PODS 2015: 145-156 - [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
- [i8]Tom J. Ameloot, Gaetano Geck, Bas Ketsman, Frank Neven, Thomas Schwentick:
Parallel-Correctness and Transferability for Conjunctive Queries. CoRR abs/1412.4030 (2014) - 2012
- [j31]Wim Martens, Frank Neven, Matthias Niewerth, Thomas Schwentick:
Developing and Analyzing XSDs through BonXai. Proc. VLDB Endow. 5(12): 1994-1997 (2012) - 2010
- [j25]Geert Jan Bex, Frank Neven, Thomas Schwentick, Stijn Vansummeren:
Inference of concise regular expressions and DTDs. ACM Trans. Database Syst. 35(2): 11:1-11:47 (2010) - 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
- [c39]Wim Martens, Frank Neven, Thomas Schwentick:
Deterministic top-down tree automata: past, present, and future. Logic and Automata 2008: 505-530 - 2007
- [j17]Wim Martens, Frank Neven, Thomas Schwentick:
Simple off the shelf abstractions for XML schema. SIGMOD Rec. 36(3): 15-22 (2007) - 2006
- [j15]Frank Neven, Thomas Schwentick:
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, Thomas Schwentick, Geert Jan Bex:
Expressiveness and complexity of XML Schema. ACM Trans. Database Syst. 31(3): 770-813 (2006) - [c27]Geert Jan Bex, Frank Neven, Thomas Schwentick, Karl Tuyls:
Inference of Concise DTDs from XML Data. VLDB 2006: 115-126 - [i4]Frank Neven, Thomas Schwentick:
On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. CoRR abs/cs/0606065 (2006) - 2005
- [c26]Wim Martens, Frank Neven, Thomas Schwentick:
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 - [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] - [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 - 2004
- [j11]Frank Neven, Thomas Schwentick, Victor Vianu:
Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Log. 5(3): 403-435 (2004) - [c24]Wim Martens, Frank Neven, Thomas Schwentick:
Complexity of Decision Problems for Simple Regular Expressions. MFCS 2004: 889-900 - 2003
- [j10]Frank Neven, Thomas Schwentick:
On the power of tree-walking automata. Inf. Comput. 183(1): 86-103 (2003) - [c20]Frank Neven, Thomas Schwentick:
XPath Containment in the Presence of Disjunction, DTDs, and Variables. ICDT 2003: 312-326 - 2002
- [j3]Frank Neven, Thomas Schwentick:
Query automata over finite trees. Theor. Comput. Sci. 275(1-2): 633-674 (2002) - 2001
- [c15]Frank Neven, Thomas Schwentick, Victor Vianu:
Towards Regular Languages over Infinite Alphabets. MFCS 2001: 560-572 - [c13]Frank Neven, Thomas Schwentick:
Automata-and Logic-Based Pattern Languages for Tree-Structured Data. Semantics in Databases 2001: 160-178 - 2000
- [c11]Frank Neven, Thomas Schwentick:
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
- [c7]Frank Neven, Thomas Schwentick:
Automata for Unary Queries on Trees. Grundlagen von Datenbanken 1999: 102-106 - [c5]Frank Neven, Thomas Schwentick:
Query Automata. PODS 1999: 205-214
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-04-11 22:46 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:
