The existence of a language expressing precisely the PTIME queries on arbitrary structures remains the central open problem in the theory of database query languages. As it turns o...
This paper addresses the problem of finding the K closest pairs between two spatial data sets, where each set is stored in a structure belonging in the R-tree family. Five diffe...
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...
Relational database (DB) management systems provide the standard means for structuring and querying large amounts of data. However, to access such data the exact structure of the D...
Raffaella Bernardi, Francesca Bonin, Diego Calvane...
We show how to efficiently evaluate generic map-filter-product queries, generalizations of select-project-join (SPJ) queries in relational algebra, based on a combination of two...
While much research has been done on finding similarities between protein sequences, there has not been the same progress on finding similarities between protein structures. Here ...
Tom Milledge, Gaolin Zheng, Tim Mullins, Giri Nara...