Coordinated data structures are sets of (perhaps unbounded) data structures where the nodes of each structure may share types with the corresponding nodes of the other structures....
Query answers from on-line databases can easily be corrupted by hackers or malicious database publishers. Thus it is important to provide mechanisms which allow clients to trust th...
Charles U. Martel, Glen Nuckolls, Premkumar T. Dev...
Fractional cascading is a technique designed to allow e cient sequential search in a graph with catalogs of total size n. The search consists of locating a key in the catalogs alo...
Prefetching offers the potential to improve the performance of linked data structure (LDS) traversals. However, previously proposed prefetching methods only work well when there i...
Magnus Karlsson, Fredrik Dahlgren, Per Stenstr&oum...
XML data can be represented by a tree or graph structure and XML query processing requires the information of structural relationships among nodes. The basic structural relationsh...