Efficient processing of XML path queries using the disk-based F&B Index

摘要: With the proliferation of XML data and applications on Internet, efficient query processing techniques are in great demand. Answering queries using indexes is a natural approach. A number have been proposed literature: among them, FB result disk-based F&B Index with good clustering properties. In addition, novel algorithms exploiting physical organization Indexes proposed. Experimental results verify that our can scale up for large size performance compared state-of-the-art algorithms.