785 search results - page 64 / 157 » Binary Join Trees |
IPL
2000
14 years 9 months ago
2000
Vajnovszki recently developed a loopless algorithm [Inform. Process. Lett. 68 (1998) 113] to enumerate Gray codes for binary trees, and then Korsh and Lafollette gave a loopless a...
TOIS
2002
14 years 9 months ago
2002
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
SIAMCOMP
2002
14 years 9 months ago
2002
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
164
click to vote
SYRCODIS
2008
14 years 11 months ago
2008
In the last few years, XML became a de-facto standard for the exchange of structured and semi-structured data. The database research community took this development into account b...
BTW
2007
Springer
15 years 1 months ago
2007
Springer
: Relational database systems are highly efficient hosts to table-shaped data. It is all the more interesting to see how a careful inspection of both, the XML tree structure as wel...