304 search results - page 5 / 61 » Dynamic ordered sets with exponential search trees |
IDEAS
2007
IEEE
14 years 2 months ago
2007
IEEE
There is an increasing need for an XML query engine that not only searches for exact matches to a query but also returns “query-like” structures. We have designed and develope...
COCOON
1998
Springer
14 years 23 days ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
ATAL
2009
Springer
14 years 3 months ago
2009
Springer
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
IIS
2003
13 years 10 months ago
2003
Abstract. In this paper we consider the problem of web search results clustering in the Polish language, supporting our analysis with results acquired from an experimental system n...
FGCS
2000
13 years 8 months ago
2000
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...