Sciweavers

21342 search results - page 3739 / 4269
» A Structured Language Model
Sort
View
FOCS
1998
IEEE
15 years 9 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
SIGOPSE
1998
ACM
15 years 9 months ago
Goal-oriented programming, or composition using events, or threads considered harmful
with this, the thread abstraction was introduced. While threads are handling events, or awaiting specific events, unrelated events can be handled by other threads. Unfortunately, ...
Robbert van Renesse
ESA
1993
Springer
109views Algorithms» more  ESA 1993»
15 years 8 months ago
Optimal Upward Planarity Testing of Single-Source Digraphs
A digraph is upward planar if it has a planar drawing such that all the edges are monotone with respect to the vertical direction. Testing upward planarity and constructing upward ...
Paola Bertolazzi, Giuseppe Di Battista, Carlo Mann...
ICDT
2010
ACM
180views Database» more  ICDT 2010»
15 years 8 months ago
Composing local-as-view mappings: closure and applications
Schema mapping composition is a fundamental operation in schema management and data exchange. The mapping composition problem has been extensively studied for a number of mapping ...
Patricia C. Arocena, Ariel Fuxman, Renée J....
EUROCAST
2007
Springer
122views Hardware» more  EUROCAST 2007»
15 years 8 months ago
Generation of Indexes for Compiling Efficient Parsers from Formal Specifications
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
Carlos Gómez-Rodríguez, Miguel A. Al...
« Prev « First page 3739 / 4269 Last » Next »