Sciweavers

1998 search results - page 360 / 400
» Complexity of the Cover Polynomial
Sort
View
LICS
2002
IEEE
14 years 2 months ago
Tree Extension Algebras: Logics, Automata, and Query Languages
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
Michael Benedikt, Leonid Libkin
SSD
2001
Springer
120views Database» more  SSD 2001»
14 years 2 months ago
On Multi-way Spatial Joins with Direction Predicates
Spatial joins are fundamental in spatial databases. Over the last decade, the primary focus of research has been on joins with the predicate “region intersection.” In modern da...
Hongjun Zhu, Jianwen Su, Oscar H. Ibarra
PODS
1999
ACM
160views Database» more  PODS 1999»
14 years 2 months ago
Queries with Incomplete Answers over Semistructured Data
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...
Yaron Kanza, Werner Nutt, Yehoshua Sagiv
STACS
1999
Springer
14 years 2 months ago
Lower Bounds for Dynamic Algebraic Problems
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...
ICDT
2010
ACM
195views Database» more  ICDT 2010»
14 years 2 months ago
Answering Non-Monotonic Queries in Relational Data Exchange
Relational data exchange deals with translating a relational database instance over some source schema into a relational database instance over some target schema, according to a ...
André Hernich