Sciweavers

785 search results - page 45 / 157
» Binary Join Trees
Sort
View
VLDB
1995
ACM
121views Database» more  VLDB 1995»
15 years 1 months ago
Benchmarking Spatial Join Operations with Spatial Output
The spatial join operation is benchmarked using variants of well-known spatial data structures such as the R-tree, R-tree, R+-tree, and the PMR quadtree. The focus is on a spatia...
Erik G. Hoel, Hanan Samet
EMNLP
2006
14 years 11 months ago
Learning Information Status of Discourse Entities
In this paper we address the issue of automatically assigning information status to discourse entities. Using an annotated corpus of conversational English and exploiting morpho-s...
Malvina Nissim
MPC
1992
Springer
235views Mathematics» more  MPC 1992»
15 years 1 months ago
Inorder Traversal of a Binary Heap and its Inversion in Optimal Time and Space
In this paper we derive a linear-time, constant-space algorithm to construct a binary heap whose inorder traversal equals a given sequence. We do so in two steps. First, we invert...
Berry Schoenmakers
ICDE
2003
IEEE
161views Database» more  ICDE 2003»
15 years 11 months ago
Structural Join Order Selection for XML Query Optimization
Structural join operations are central to evaluating queries against XML data, and are typically responsible for consuming a lion's share of the query processing time. Thus, ...
Yuqing Wu, Jignesh M. Patel, H. V. Jagadish
KDD
1999
ACM
185views Data Mining» more  KDD 1999»
15 years 2 months ago
Visual Classification: An Interactive Approach to Decision Tree Construction
Satisfying the basic requirements of accuracy and understandability of a classifier, decision tree classifiers have become very popular. Instead of constructing the decision tree ...
Mihael Ankerst, Christian Elsen, Martin Ester, Han...