Background: In recent times, there has been an exponential rise in the number of protein structures in databases e.g. PDB. So, design of fast algorithms capable of querying such d...
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance prec...
—Authority flow and proximity search have been used extensively in measuring the association between entities in data graphs, ranging from the Web to relational and XML database...
Database support of time-varying phenomena typically assumes that entities change in a linear fashion. Many phenomena, however, change cyclically over time. Examples include monsoo...
Kathleen Hornsby, Max J. Egenhofer, Patrick J. Hay...
Schema matching identifies elements of two given schemas that correspond to each other. Although there are many algorithms for schema matching, little has been written about build...
Philip A. Bernstein, Sergey Melnik, Michalis Petro...