P. Stuckey. Constraint Search Trees. In Logic Programming: Proc. of the 14th International Conference, pages 301--315, Cambridge, MA, July 1997. MIT Press.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....index as well as a higher demand of storage space. This report examines whether adding only a simple extension of information about the object can result into a better IO performance. This is done by presenting a new data structure, the O Tree, in the general framework of constraint search trees [Stu97]. 2 Constraint Search Trees Many spatial data structures are based on search tree like indexing structures, e.g binary search trees, kd trees [Ben75] R and R trees [BKSS90] and Btrees. The behavior of these trees can be abstracted by a more general tree structure. One general framework ....

....general framework for search trees are the Generalized Search Trees (GiSTs) by Hellerstein, et al. HNP95] This index structure provides a structure for an extensible set of queries and data types. Another general framework for search trees based on constraints are Constraint Search Trees (CSTs) [Stu97]. They express the behavior of data structures by using constraints and can be used to mimic all kinds of search trees. A major advantage of constraint search trees is that only partial algorithms are required. This is not the case for GiSTs whose algorithms have to be complete. This section gives ....

Peter Stuckey. Constraint Search Trees. In Logic Programming: Proc. of the 14th International Conference, pages 301-315, Cambridge, MA, July 1997. MIT Press. 44

....a way of storing collections of objects which allows efficient access, insertion and deletion by key value. Many variants of search trees have been defined and studied such as binary search trees, radix search trees, k d trees [1] B trees and R trees [2] Constraint search trees (CSTs) defined in [8] abstract the fundamental behaviour of a search tree in terms of constraints. CSTs store data items in the form of constraints (in practice a constraint key is used to store arbitrary items) and constraints are used to control the search in the tree. CSTs were originally defined as binary trees. ....

....in the general framework of heightbalanced constraint search trees, and investigate whether its extra information can improve IO performance. 2. Constraint Search Trees Constraint search trees are a general framework for search trees based on the notions of constraint satisfaction and entailment [8]. In this paper we introduce heightbalanced constraint search trees and exemplify their use with O trees. First we quickly review the original definitions. 2.1. Binary Constraint Search Trees In general, search trees consist of a set of external or leaf nodes, and a set of internal or directory ....

[Article contains additional citation context not shown here]

P. Stuckey. Constraint Search Trees. In Logic Programming: Proc. of the 14th International Conference, pages 301--315, Cambridge, MA, July 1997. MIT Press.

....index as well as a higher demand of storage space. This report examines whether adding only a simple extension of information about the object can result into a better IO performance. This is done by presenting a new data structure, the O Tree, in the general framework of constraint search trees [Stu97]. 2 Constraint Search Trees Many spatial data structures are based on search tree like indexing structures, e.g binary search trees, kd trees [Ben75] R and R trees [BKSS90] and Btrees. The behavior of these trees can be abstracted by a more general tree structure. One general framework ....

....general framework for search trees are the Generalized Search Trees (GiSTs) by Hellerstein, et al. HNP95] This index structure provides a structure for an extensible set of queries and data types. Another general framework for search trees based on constraints are Constraint Search Trees (CSTs) [Stu97]. They express the behavior of data structures by using constraints and can be used to mimic all kinds of search trees. A major advantage of constraint search trees is that only partial algorithms are required. This is not the case for GiSTs whose algorithms have to be complete. This section gives ....

Peter Stuckey. Constraint Search Trees. In Logic Programming: Proc. of the 14th International Conference, pages 301-315, Cambridge, MA, July 1997. MIT Press. 44

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC