Abstract
We present a family of character-based index schemes for wildcard search in peer-to-peer networks. The supported query format allows the two wildcard matching operators ‘?’ and ‘*’ to be used arbitrarily. To our knowledge, no distributed solution for this general form of wildcard search has been proposed thus far. Moreover, the schemes can achieve balanced loads, avoid hot-spots and single points of failure, reduce storage and maintenance costs, and offer ranking mechanisms for matching objects. The main focus is on a thorough comparative study on these index schemes from the following perspectives: query expressiveness, encoding effectiveness, load balance, and search performance.
Sign-in/Register to access full text options 
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.
