Sciweavers

49 search results - page 9 / 10
» Logical Foundations for Similarity-Based Databases
Sort
View
DIMACS
1996
13 years 7 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin
PODS
2002
ACM
117views Database» more  PODS 2002»
14 years 5 months ago
Monadic Datalog and the Expressive Power of Languages for Web Information Extraction
Research on information extraction from Web pages (wrapping) has seen much activity in recent times (particularly systems implementations), but little work has been done on formal...
Georg Gottlob, Christoph Koch
PODS
2005
ACM
99views Database» more  PODS 2005»
14 years 5 months ago
XML type checking with macro tree transducers
MSO logic on unranked trees has been identified as a convenient theoretical framework for reasoning about expressiveness and implementations of practical XML query languages. As a...
Sebastian Maneth, Alexandru Berlea, Thomas Perst, ...
FOCS
1998
IEEE
13 years 10 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
ADC
2009
Springer
122views Database» more  ADC 2009»
14 years 11 days ago
What is Required in Business Collaboration?
Access control has been studied for sometime, and there are a number of theories and techniques for handling access control for single or centralised systems; however, unique and ...
Daisy Daiqin He, Michael Compton, Kerry Taylor, Ji...