#### Filter Results:

- Full text PDF available (76)

#### Publication Year

1997

2017

- This year (5)
- Last 5 years (30)
- Last 10 years (59)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- David A. Mix Barrington, Neil Immerman, Clemens Lautemann, Nicole Schweikardt, Denis Thérien
- J. Comput. Syst. Sci.
- 2005

A language L over an alphabet A is said to have a neutral letter if there is a letter e ∈ A such that inserting or deleting e's from any word in A * does not change its membership or non-membership in L. The presence of a neutral letter affects the definability of a language in first-order logic. It was conjectured that it renders all numerical predicates… (More)

- Oliver Matz, Nicole Schweikardt, Wolfgang Thomas
- Inf. Comput.
- 2002

The monadic second-order quantiier alternation hierarchy over the class of nite graphs is shown to be strict. The proof is based on automata theoretic ideas and starts from a restricted class of graph-like structures, namely nite two-dimensional grids. Considering grids where the width is a function of the height, we prove that the diierence between the… (More)

We introduce an extension of the XQuery language , FluX, that supports event-based query processing and the conscious handling of main memory buffers. Purely event-based queries of this language can be executed on streaming XML data in a very direct way. We then develop an algorithm that allows to efficiently rewrite XQueries into the event-based FluX… (More)

- Martin Grohe, Christoph Koch, Nicole Schweikardt
- Theor. Comput. Sci.
- 2005

It is generally assumed that databases have to reside in external, inexpensive storage because of their sheer size. Current technology for external storage systems presents us with a reality that performance-wise, a small number of sequential scans of the data is strictly preferable over random data accesses. Database technology — in particular query… (More)

- Nicole Schweikardt
- ACM Trans. Comput. Log.
- 2005

This article gives a thorough overview of what is known about first-order logic with counting quantifiers and with arithmetic predicates. As a main theorem we show that Presburger arithmetic is closed under unary counting quantifiers. Precisely, this means that for every first-order formula ϕ(<i>y</i>,<i>z</i>) over the signature… (More)

- Martin Grohe, Nicole Schweikardt
- PODS
- 2005

We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situation are the size of the main memory and the number of random accesses to external memory. We note that sequentially streaming data from external memory through main memory is much… (More)

- André Hernich, Nicole Schweikardt
- PODS
- 2007

Data exchange deals with the following problem: given an instance over a source schema, a specification of the relationship between the source and the target,and dependencies on the target, construct an instance over a target schema that satisfies the given relationships and dependencies. Recently - for data exchange settings without target dependencies -… (More)

A language L over an alphabet A is said to have a neutral letter if there is a letter e ∈ A such that inserting or deleting e's from any word in A * does not change its membership (or non–membership) in L. The presence of a neutral letter affects the definability of a language in first–order logic. It was conjectured that it renders all numerical predicates… (More)