Sciweavers

439 search results - page 72 / 88
» Unnesting Arbitrary Queries
Sort
View
PODS
2006
ACM
116views Database» more  PODS 2006»
14 years 10 months ago
Relational lenses: a language for updatable views
We propose a novel approach to the classical view update problem. The view update problem arises from the fact that modifications to a database view may not correspond uniquely to...
Aaron Bohannon, Benjamin C. Pierce, Jeffrey A. Vau...
PODS
2007
ACM
104views Database» more  PODS 2007»
14 years 10 months ago
XML transformation by tree-walking transducers with invisible pebbles
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of `invisible' pebbles (as opposed to the usual `visible�...
Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samw...
PODS
2008
ACM
129views Database» more  PODS 2008»
14 years 10 months ago
Tree-width and functional dependencies in databases
Conjunctive query (CQ) evaluation on relational databases is NP-complete in general. Several restrictions, like bounded tree-width and bounded hypertree-width, allow polynomial ti...
Isolde Adler
WABI
2009
Springer
130views Bioinformatics» more  WABI 2009»
14 years 4 months ago
Linear-Time Protein 3-D Structure Searching with Insertions and Deletions
It becomes more and more important to search for similar structures from molecular 3-D structure databases in the structural biology of the post genomic era. Two molecules are said...
Tetsuo Shibuya, Jesper Jansson, Kunihiko Sadakane
ESA
2009
Springer
90views Algorithms» more  ESA 2009»
14 years 4 months ago
Storing a Compressed Function with Constant Time Access
We consider the problem of representing, in a space-efficient way, a function f : S → Σ such that any function value can be computed in constant time on a RAM. Specifically, ou...
Jóhannes B. Hreinsson, Morten Krøyer...