439 search results - page 29 / 88 » Unnesting Arbitrary Queries |
IDEAS
2002
IEEE
14 years 2 months ago
2002
IEEE
Boolean expression simplification is a well-known problem in the history of Computer Science. The problem of determining prime implicates from an arbitrary Boolean expression has...
DASFAA
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract. We have defined an XML structural index called the Structure Index Tree (SIT), which eliminates duplicate structures arising from the equivalent subtrees in an XML docume...
VLDB
2007
ACM
14 years 10 months ago
2007
ACM
This paper addresses the efficient processing of similarity queries in metric spaces, where data is horizontally distributed across a P2P network. The proposed approach does not r...
CVPR
1997
IEEE
14 years 2 months ago
1997
IEEE
We describe a new multi-phase, color-based image retrieval system, FOCUS Fast Object Color-based qUery System , with an online user interface which is capable of identifying mult...
KR
1992
Springer
14 years 2 months ago
1992
Springer
While the task of answering queries from an arbitrary propositional theory is intractable in general, it can typicallybe performed e ciently if the theory is Horn. This suggests t...