A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
Visual exploration systems enable users to search, browse, and explore voluminous multimedia databases in an interactive and playful manner. Whether users know the database's ...
The DBGraph storage model, designed for main memory DBMS, ensures both data storage compactness and efficient processing for all database operations. By representing the entire da...
The peer-to-peer (P2P) paradigm has emerged recently, mainly by file sharing systems like Napster or Gnutella and in terms of scalable distributed data structures. Because of the d...