Abstract
A polynomial time dynamic method for similar retrieval in pictorial database systems is presented. Although several algorithms have been published, they all focus on static data sets. With regard to applications in a dynamic environment, they all seem too obtuse to be used efficiently. To overcome this defect, we have to utilize some dynamic data structures. The well-known trie hashing and extendible hashing techniques are what we employ. Both of them have proven to have good performance in database management systems. From a practical point of view, it is feasible to transplant these mechanisms into pictorial database systems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
