Author to whom all correspondence should be addressed.
1098-111X/asset/INT_left.gif?v=1&s=c0d44ac5ce99265330169e2ac3d22da4ab6b1a5d)
1098-111X/asset/INT_centre.gif?v=1&s=e94826a6788e7bb0695867b68ca2c030d8c7a252)
1098-111X/asset/INT_right.gif?v=1&s=d4616ff123f9b0a0199cc9f89f77f112e4ce3a70)
Virtual path signature: An approach for flexible searching in object-oriented databases
Article first published online: 12 JAN 2004
DOI: 10.1002/int.10150
Copyright © 2004 Wiley Periodicals, Inc.
Issue
1098-111X/asset/cover.gif?v=1&s=7f7c12f2c86265974044b2b3f9936860ffc468a0 "International Journal of Intelligent Systems")
International Journal of Intelligent Systems
Special Issue: Intelligent Technologies
Volume 19, Issue 1-2, pages 51–63, January - February 2004
Additional Information
How to Cite
Mahatthanapiwat, P. and Rivepiboon, W. (2004), Virtual path signature: An approach for flexible searching in object-oriented databases. Int. J. Intell. Syst., 19: 51–63. doi: 10.1002/int.10150
Publication History
- Issue published online: 12 JAN 2004
- Article first published online: 12 JAN 2004
- Abstract
- References
- Cited By
Abstract
Signature technique that is proposed for multikey indexing is used for flexible searching in the area of databases. In this article, we present a new signature technique called Virtual Path Signature for supporting query processing of aggregation hierarchy as a tree in object-oriented databases (OODBs). We derive cost formulas for its storage overhead as well as the retrieval cost. Comparing with the Tree Signature Scheme, the Virtual Path Signature shows significant improvement in the retrieval operation, especially when the target distance between the target class and the predicate class is high. © 2004 Wiley Periodicals, Inc.