Improved methods for signature-tree construction

Computer Journal

Volumn 43, Issue 4, 2000, Pages 301-314

  Tousidou, Eleni ^a   Nanopoulos, Alex ^a   Manolopoulos, Yannis ^a  

^a ARISTOTLE UNIVERSITY OF THESSALONIKI   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; DATABASE SYSTEMS; INFORMATION RETRIEVAL; RESPONSE TIME (COMPUTER SYSTEMS); WORLD WIDE WEB;

OBJECT ORIENTED DATABASES; PARTIAL-MATCH QUERY; SIGNATURE-TREE CONSTRUCTION;

TREES (MATHEMATICS);

EID: 0034516804     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/43.4.301     Document Type: Article

References (37)

1. Andre-Jönsson, H. and Badal, D. (1997) Using signature files for querying time-series data. Proc. 1st Eur. Symp. on Principles of Data Mining and Knowledge Discovery, Trodheim, Norway, pp. 211-220.
2. Agrawal, R., Imielinski T. and Swami, A. N. (1993) Mining association rules between sets of items in large databases. Proc. 1993 ACM SIGMOD Conf., Washington, DC, pp. 207-216.
3. Rabitti, F. and Zezula, P. (1990) A dynamic signature technique for multimedia databases. Proc. 13th ACM SIGIR Conf., Brussels, Belgium, pp. 193-210.
4. Faloutsos, C., Lee, R., Plaisant, C. and Shneiderman, B. (1990) Incorporating string search in a hypertext system: user interface and signature file design issues. HyperMedia, 2, 163-174.
5. Chidlovskii, B. and Borghoff, U. M. (1998) Signature file methods for semantic query caching. Proc. 2nd ECDL Conf., Heraklion, Greece, pp. 479-498.
6. Lee, W. C. and Lee, D. L. (1999) Signature caching techniques for information filtering in mobile environments. ACM Wireless Networks, 5, 57-67.
7. Christodoulakis, S. and Faloutsos, C. (1984) Signature files: an access method for documents and its analytical performance evaluation. ACM Trans. Office Inform. Syst., 2, 267-288.
8. Faloutsos, C. (1992) Signature files. In Frakes, W. B. and Baeza-Yates, R. (eds), Information Retrieval: Data Structures and Algorithms. Prentice Hall, Englewood Cliffs, NJ.
9. Dervos, D., Manolopoulos, Y. and Linardis, P. (1998) Comparison of signature file models with superimposed coding. Inform. Proc. Lett., 65, 101-106.
10. Kocberber, S., Can, F. and Paton, J. (1999) Optimization of signature file parameters with varying record lengths. Comp. J., 42, 11-23.
11. Deppisch, U. (1986) S-tree: a dynamic balanced signature index for office retrieval. Proc. 9th ACM SIGIR Conf., Pisa, Italy, pp. 77-87.
12. Sacks-Davis, R. and Ramamohanarao, K. (1983) A two level superimposed coding scheme for partial match retrieval. Inform. Syst., 8, 273-289.
13. Pfaltz, J., Berman, W. and Cagley, E. (1980) Partial match retrieval using indexed descriptor files. Commun. ACM, 23, 522-528.
14. Ciaccia, P. and Zezula, P. (1996) Declustering of key-based partitioned signature files. ACM Trans. Database Syst., 21, 295-338.
15. Lee, D. L. and Leng, C. W. (1989) Partitioned signature files: design issues and performance evaluation. ACM Trans. Office Inform. Syst., 7, 158-180.
16. Lee, D. L. and Leng, C. W. (1990) A partitioned signature file structure for multiattribute and text retrieval. Proc. 6th IEEE Conf. on Data Engineering (ICDE'90), Los Angeles, CA, pp. 389-397.
17. Zezula, P., Rabitti, F. and Tiberio, P. (1991) Dynamic partitioning of signature files. ACM Trans. Inform. Syst., 9, 336-369.
18. Zezula, P., Ciaccia, P. and Tiberio, P. (1993) Hamming filter: a dynamic signature file organization for parallel stores. Proc. 19th VLDB Conf., pp. 314-327.
19. Ishikawa, Y., Kitagawa, H. and Ohbo, N. (1993) Evaluation of signature files as set access facilities in OODBs. Proc. 1993 ACM SIGMOD Conf., Washington, DC, pp. 247-256.
20. Kitagawa, H., Fukushima, Y., Ishikawa, Y and Ohbo, N. (1993) Estimation of false drops in set-valued object retrieval with signature files. Proc. 4th FODO Conf., Chicago, IL, pp. 146-163.
21. Kitagawa, H., Watanabe, N. and Ishikawa, Y. (1996) Design and evaluation of signature file organization incorporating vertical and horizontal decomposition schemes. Proc. 7th DEXA Conf., Zurich, Switzerland, pp. 875-888.
22. Hellerstein, J. M. and Pfeffer, A. (1994) The RD-Tree: an Index Structure for Sets. Technical Report No. 1252, University of Wisconsin at Madison.
23. Helmer, S. and Moerkotte, G. (1997) Evaluation of main memory join algorithms for joins with set comparison join predicates. Proc. 23rd VLDB Conf., Athens, Greece, pp. 386-395.
24. Lee, W. C. and Lee, D. L. (1992) Signature file methods for indexing object-oriented database systems. Proc. 2nd Computer Science Conf., Hong Kong, pp. 616-622.
25. Lee, D. L. and Lee, W. C. (1996) Signature path dictionary for nested object query processing. Proc. IEEE Phoenix Conf. on Computers and Communications (IPCCC'96), Phoenix, pp. 275-281.
26. Yong, H. S., Lee, S. and Kim, H. J. (1994) Applying signatures for forward traversal query processing in object-oriented databases. Proc. 10th IEEE Conf. on Data Engineering (ICDE'94), pp. 518-525.
27. Tousidou, E., Bozanis, P. and Manolopoulos, Y. Efficient handling of signature files used for objects with set-valued attributes, submitted.
28. Beckmann, N., Kriegel, H. P., Schneider, R. and Seeger, B. (1990) The R*-tree: an efficient and robust access method for points and rectangles. Proc. 1990 ACM SIGMOD Conf., Atlantic City, NJ, pp. 322-331.
29. Manolopoulos, Y., Theodoridis, Y. and Tsotras, V. (1999) Advanced Database Indexing. Kluwer Academic Publishers, Boston, MA.
30. Ang, C. H. and Tan, T. C. (1997) New linear node splitting algorithm for R-trees. Proc. 5th SSD Symp., Berlin, Germany, pp. 339-349.
31. Faloutsos, C. and Lin, K.-I. (1995) FastMap: a fast algorithm for indexing, data mining and visualization of traditional and multimedia datasets. Proc. 1995 ACM SIGMOD Conf., San Jose, CA, pp. 183-200.
32. Guttman, A. (1984) R-trees: a dynamic index structure for spatial searching. Proc. 1984 ACM SIGMOD Conf., Boston, MA, pp. 47-57.
33. Ciaccia, P., Patella, M. and Zezula, P. (1997) M-tree: an efficient access method for similarity search in metric spaces. Proc. 23rd VLDB Conf., pp. 426-435.
34. Eppstein, D. (1998) Fast hierarchical clustering and other applications of dynamic closest pairs. Proc. 9th ACM-SIAM Symp. on Discrete Algorithms, San Francisco, CA, pp. 619-628.
35. Im, B. M., Yoo, J. S. and Kim, M. H. (1998) A Dynamic Signature File Declustering Method based on the Signature Difference. Technical Report, KAIST, Korea.
36. Bozanis, P., Makris, C. and Tsakalidis, A. (1995) Parametric weighted filter: an efficient dynamic manipulation of signature files. Comp. J., 38, 478-488.
37. Tousidou, E., Vassilakopoulos, M. and Manolopoulos, Y. (2000) Performance evaluation of parallel S-trees. J. Database Management, 11, 28-34.