|
Published Articles >> Table of Contents >> Abstract
21st International Conference on Data Engineering (ICDE'05)
pp. 742-753
On the Signature Trees and Balanced Signature Trees
Yangjun Chen, University of Winnipeg
Full Article Text:
  
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDE.2005.99
Send link to a friend
| Abstract |
|
Advanced database application areas, such as computer
aided design, office automation, digital libraries, data-mining
as well as hypertext and multimedia systems need to
handle complex data structures with set-valued attributes,
which can be represented as bit strings, called signatures. A
set of signatures can be stored in a file, called a signature
file. In this paper, we propose a new method to organize a
signature file into a tree structure, called a signature tree, to
speed up the signature file scanning and query evaluation.
|
 Additional Information
|
Index Terms- Signature files, Bit-slice files, S-trees, Signature trees, Information retrieval
Citation:
Yangjun Chen,
"On the Signature Trees and Balanced Signature Trees,"
icde,
pp. 742-753,
21st International Conference on Data Engineering (ICDE'05),
2005
|
|
