Signature Indexing with Tree Structures

  • Yannis Manolopoulos
  • Alexandros Nanopoulos
  • Eleni Tousidou
Part of the Advances in Database Systems book series (ADBS, volume 27)


The first structure that has been used for signature data is the sequential file [3], which is efficient in handling new insertions, since new entries are simply appended to the end of the file. This way, for each query processed, the entire signature file needs to be scanned. Consequently, the signature file involves high processing and I/O cost.


Split Method Query Execution Disk Access Split Algorithm Signature Indexing 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [1]
    C.H. Ang, T.C. Tan. “New Linear Node Splitting Algorithm for R-trees”. Pro-ceedings 5th Symposium on Spatial Databases (SSD’97), pp.339–349, Berlin, Germany, 1997.Google Scholar
  2. [2]
    N. Beckmann, H.-P Kriegel, R. Schneider, B. Seeger. “The R*-Tree: an Efficient and Robust Access Method for Points and Rectangles”. Proceedings ACM International Conference on Management of Data (SIGMOD’90), pp.322–331, Atlantic City, NJ, 1990.Google Scholar
  3. [3]
    S. Christodoulakis, C. Faloutsos. “Signature Files: an Access Method for Documents and its Analytical Performance Evaluation”. ACM Transactions on Office Information Systems, Vol.2, No.4, pp.267–288, 1984.CrossRefGoogle Scholar
  4. [4]
    P. Ciaccia, M. Patella, P. Zezula. “M-tree: an Efficient Access Method for Similarity Search in Metric Spaces”. Proceedings 23rd International Conference on Very Large Data Bases (VLDB’97), pp.426–435, Athens, Greece, 1997.Google Scholar
  5. [5]
    P. Ciaccia, P. Zezula. “Declustering of Key-Based Partitioned Signature Files”. ACM Transactions on Database Systems, Vol.21, No.3, pp.295–338, 1996.CrossRefGoogle Scholar
  6. [6]
    U. Deppisch. “S-tree: a Dynamic Balanced Signature Index for Office Retrieval”. Proceedings 9th ACM International Conference on Information Retrieval (SI-GIR’86), pp.77–87, Pisa, Italy, 1986.Google Scholar
  7. [7]
    D. Eppstein. “Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs”. Proceedings 9th ACM-SIAM Symposium on Discrete Algorithms (SODA’ 98), pp.619–628, San Francisco, CA, 1998.Google Scholar
  8. [8]
    C. Faloutsos, K.-I. Lin. “FastMap: a Fast Algorithm for Indexing, Data Mining and Visualization of Traditional and Multimedia Datasets”. Proceedings ACM International Conference on Management of Data (SIGMOD’95), pp. 183–200, San Jose, CA, 1995.Google Scholar
  9. [9]
    A. Guttman. “R-trees: a Dynamic Index Structure for Spatial Searching”, Proceedings ACM International Conference on Management of Data (SIGMOD’84), pp.47–57, Boston, MA, 1984.Google Scholar
  10. [10]
    J.M. Hellerstein, A. Pfeffer. “The RD-Tree: an Index Structure for Sets”, Technical Report No.1252, University of Wisconcin at Madison, 1994.Google Scholar
  11. [11]
    S. Helmer, G. Moerkotte. “Evaluation of Main Memory Join Algorithms for Joins with Set Comparison Join Predicates”. Proceedings 23rd International Conference on Very Large Data Bases (VLDB’97), pp.386–395, Athens, Greece, 1997.Google Scholar
  12. [12]
    B.M. Im, J.S. Yoo, M.H. Kim. “A Dynamic Signature File Declustering Method based on the Signature Difference”. Technical Report, KAIST, Korea, 1998.Google Scholar
  13. [13]
    Y. Ishikawa, H. Kitagawa, N. Ohbo. “Evaluation of Signature Files as Set Access Facilities in OODBs”. Proceedings ACM International Conference on Management of Data (SIGMOD’93), pp.247–256, Washington, DC, 1993.Google Scholar
  14. [14]
    H. Kitagawa, Y. Fukushima, Y. Ishikawa, N. Ohbo. “Estimation of False Drops in Set-valued Object Retrieval with Signature Files”. Proceedings 4th International Conference on Foundations of Data Organization and Algorithms (FODO’93), pp.146–163, Chicago, IL, 1993.Google Scholar
  15. [15]
    H. Kitagawa, N. Watanabe, Y. Ishikawa. “Design and Evaluation of Signature File Organization Incorporating Vertical and Horizontal Decomposition Schemes”. Proceedings 7th International Workshop on Database and Expert Systems Applications (DEXA’96), pp.875–888, Zurich, Switzerland, 1996.Google Scholar
  16. [16]
    W.C. Lee, D.L. Lee. “Signature File Methods for Indexing Object-Oriented Database Systems”. Proceedings 2nd International Computer Science Conference, pp.616–622, Hong Kong, China, 1992.Google Scholar
  17. [17]
    D.L. Lee, W.C. Lee. “Signature Path Dictionary for Nested Object Query Processing”. Proceedings IEEE International Phoenix Conference on Computers and Communications (IPCCC’ 96), pp.275–281, 1996.Google Scholar
  18. [18]
    D.L. Lee, C.W. Leng. “Partitioned Signature Files: Design Issues and Performance Evaluation”. ACM Transactions on Office Information Systems, Vol.7, No.2, pp.150–180, 1989.CrossRefGoogle Scholar
  19. [19]
    D.L. Lee, C.W. Leng. “A Partitioned Signature File Structure for Multiattribute and Text Retrieval”. Proceedings 6th IEEE Conference on Data Engineering (ICDE’90), pp.389–397, Los Angeles, CA, 1990.Google Scholar
  20. [20]
    Y. Manolopoulos, Y. Theodoridis, V. Tsotras. “Advanced Database Indexing”, Kluwer Academic Publishers, 1999.Google Scholar
  21. [21]
    J. Pfaltz, W. Berman, E. Cagley. “Partial Match Retrieval using Indexed Descriptor Files”. Communications of the ACM, Vol.23, No.9, pp.522–528, 1980.MathSciNetMATHCrossRefGoogle Scholar
  22. [22]
    R. Sacks-Davis, K. Ramamohanarao. “A Two level Superimposed Coding Scheme for Partial Match Retrieval. Information Systems, Vol.8, No.4, pp.273–289, 1983.CrossRefGoogle Scholar
  23. [23]
    E. Tousidou, A. Nanopoulos, Y. Manolopoulos. “Improved Methods for Signature Tree Construction”. The Computer Journal, Vol.43, No.4, pp.301–314, 2000.MATHCrossRefGoogle Scholar
  24. [24]
    H.S. Yong, S. Lee, H.J. Kim. “Applying Signatures for Forward Traversal Query Processing in Object-Oriented Databases”. Proceedings 10th IEEE Conference on Data Engineering (ICDE’94), pp.518–525, Houston, TX, 1994.Google Scholar
  25. [25]
    P. Zezula, P. Ciaccia, P. Tiberio. “Hamming Filter: a Dynamic Signature File Organization for Parallel Stores”. Proceedings 19th International Conference on Very Large Data Bases (VLDB’93), pp.314–327, Dublin, Ireland, 1993.Google Scholar
  26. [26]
    P. Zezula, F. Rabitti, P. Tiberio. “Dynamic Partitioning of Signature Files. ACM Transactions on Information Systems, Vol.9, No.4, pp.336–369, 1991.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2003

Authors and Affiliations

  • Yannis Manolopoulos
    • 1
  • Alexandros Nanopoulos
    • 1
  • Eleni Tousidou
    • 1
  1. 1.Aristotle University of ThessalonikiGreece

Personalised recommendations