Sciweavers

1588 search results - page 36 / 318
» Consistent query answering in databases
Sort
View
ER
2007
Springer
163views Database» more  ER 2007»
15 years 10 months ago
Know your Limits: Enhanced XML Modeling with Cardinality Constraints
XML Schema supports the specification of occurrence constraints by declaring values for its min/maxOccurs attributes. These constraints are structural in the sense that they rest...
Sebastian Link, Thu Trinh
FQAS
2004
Springer
122views Database» more  FQAS 2004»
15 years 7 months ago
Simplification of Integrity Constraints with Aggregates and Arithmetic Built-Ins
In the context of relational as well as deductive databases, correct and efficient integrity checking is a crucial issue, as, without any guarantee of data consistency, the answers...
Davide Martinenghi
ICDE
2011
IEEE
233views Database» more  ICDE 2011»
14 years 7 months ago
Answering approximate string queries on large data sets using external memory
— An approximate string query is to find from a collection of strings those that are similar to a given query string. Answering such queries is important in many applications su...
Alexander Behm, Chen Li, Michael J. Carey
PLANX
2008
15 years 5 months ago
Complexity of Earliest Query Answering with Streaming Tree Automata
We investigate the complexity of earliest query answering for n-ary node selection queries defined by streaming tree automata (STAs). We elaborate an algorithm that selects query ...
Olivier Gauwin, Anne-Cécile Caron, Joachim ...
WEBDB
2000
Springer
136views Database» more  WEBDB 2000»
15 years 7 months ago
An Optimization Technique for Answering Regular Path Queries
Rewriting queries using views is a powerful technique that has applications in data integration, data warehousing and query optimization. Query rewriting in relational databases i...
Gösta Grahne, Alex Thomo