We consider the problem of efficiently computing weighted proximity best-joins over multiple lists, with applications in information retrieval and extraction. We are given a multi-...
AnHai Doan, Haixun Wang, Hao He, Jun Yang 0001, Ri...
The frequent items problem is to process a stream of items and find all items occurring more than a given fraction of the time. It is one of the most heavily studied problems in d...
We study the problem of maintaining materialized views of graph structured data. The base data consists of records containing identi ers of other records. The data could represent...
The XML has undoubtedly become a standard for data representation and manipulation. But most of XML documents are still created without the respective description of their structu...
Cryptographic techniques for reasoning about information leakage have recently been brought to bear on the classical problem of statistical disclosure control – revealing accurat...