143 search results - page 8 / 29 » Query Order and the Polynomial Hierarchy |
SIGECOM
2003
ACM
14 years 4 months ago
2003
ACM
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...
MDM
2004
Springer
14 years 4 months ago
2004
Springer
Data broadcasting is well known for its excellent scalability. Multi-dimensional range queries, such as spatial range queries of geographical information for location dependent se...
ICDT
1997
ACM
14 years 3 months ago
1997
ACM
We consider spatial databases and queries definable using first-order logic and real polynomial inequalities. We are interested in topological queries: queries whose result only ...
TIME
2000
IEEE
14 years 3 months ago
2000
IEEE
In spatiotemporal applications, meaningful changes vary according to object type, level of detail, and nature of application. In this paper, we introduce a dynamic classification ...
ICDE
2010
IEEE
13 years 8 months ago
2010
IEEE
Abstract-- Classification hierarchies are trees where links codify the fact that a node lower in the hierarchy contains documents whose contents are more specific than those one le...