1004 search results - page 23 / 201 » Safe Constraint Queries |
109
Voted
ICDT
2003
ACM
15 years 5 months ago
2003
ACM
We state and solve the query reformulation problem for XML publishing in a general setting that allows mixed (XML and relational) storage for the proprietary data and exploits redu...
89
Voted
ICDT
2003
ACM
15 years 5 months ago
2003
ACM
We study extensions of first-order logic over the reals with different types of transitive-closure operators as query languages for constraint databases that can be described by...
109
Voted
ICDT
2001
ACM
15 years 4 months ago
2001
ACM
In fast OLAP applications it is often advantageous to provide approximate answers to range queries in order to achieve very high performances. A possible solution is to inquire sum...
104
click to vote
PCI
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Given two datasets DA and DB the closest-pair query (CPQ) retrieves the pair (a,b), where a ∈ DA and b ∈ DB, having the smallest distance between all pairs of objects...
116
click to vote
ER
2007
Springer
15 years 6 months ago
2007
Springer
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...