| Publication | Date of Publication | Type |
|---|
Data sufficiency for queries on cache
Information Processing Letters | 2016-06-09 | Paper |
Static analysis in Datalog extensions
Journal of the ACM | 2015-10-30 | Paper |
Approximation schemes for deal splitting and covering integer programs with multiplicity constraints
Theoretical Computer Science | 2012-01-04 | Paper |
An algorithm for partitioning trees augmented with sibling edges
Information Processing Letters | 2010-06-09 | Paper |
A quantitative foundation for defining and manipulating deals to facilitate automated e-commerce
Electronic Commerce Research | 2008-01-14 | Paper |
Intersection graphs of \(k\)-acyclic families of subtrees and relational database query processing.
Information Processing Letters | 2006-01-17 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2005-12-14 | Paper |
Acyclic Hypergraph Projections
Journal of Algorithms | 1999-03-30 | Paper |
Utilizing the multiple facets of WWW contents
Data & Knowledge Engineering | 1999-01-12 | Paper |
How expressive is stratified aggregation?
Annals of Mathematics and Artificial Intelligence | 1996-10-20 | Paper |
A framework for testing safety and effective computability
Journal of Computer and System Sciences | 1996-07-16 | Paper |
A single recursive predicate is sufficient for pure datalog
Information and Computation | 1996-01-02 | Paper |
| scientific article; zbMATH DE number 549994 (Why is no real title available?) | 1994-04-12 | Paper |
Equivalence of Datalog queries is undecidable
The Journal of Logic Programming | 1993-05-16 | Paper |
Compilation of set terms in the logic data language (LDL)
The Journal of Logic Programming | 1992-08-13 | Paper |
Set constructors in a logic database language
The Journal of Logic Programming | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4211480 (Why is no real title available?) | 1991-01-01 | Paper |
Distributing a \(B^+\)-tree in a loosely coupled environment
Information Processing Letters | 1990-01-01 | Paper |
A characterization of finite fd-acyclicity
Journal of Computer and System Sciences | 1989-01-01 | Paper |
Cooperative Distributed Algorithms for Dynamic Cycle Prevention
IEEE Transactions on Software Engineering | 1987-01-01 | Paper |
Complexity of Views: Tree and Cyclic Schemas
SIAM Journal on Computing | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4028945 (Why is no real title available?) | 1986-01-01 | Paper |
The tree projection theorem and relational query processing
Journal of Computer and System Sciences | 1984-01-01 | Paper |
GYO reductions, canonical connections, tree and cyclic schemas, and tree projections
Journal of Computer and System Sciences | 1984-01-01 | Paper |
Syntactic Characterization of Tree Database Schemas
Journal of the ACM | 1983-01-01 | Paper |
Dynamic cycle detection
Information Processing Letters | 1983-01-01 | Paper |
NP-complete problems simplified on tree schemas
Acta Informatica | 1983-01-01 | Paper |
Tree queries
ACM Transactions on Database Systems | 1982-01-01 | Paper |
