We present a novel framework for mapping between any combination of XML and relational schemas, in which a high-level, userspecified mapping is translated into semantically meanin...
Given two sets A and B of m non-intersecting line segments in the plane, we show how to compute in O(m log m) time a data structure that uses O(m) space and allows to answer the fo...
Otfried Cheong, Hazel Everett, Hyo-Sil Kim, Sylvai...
The inability to answer proximity queries efficiently for spaces of dimension d > 2 has led to the study of approximation to proximity problems. Several techniques have been pro...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
Large web search engines have to answer thousands of queries per second with interactive response times. Due to the sizes of the data sets involved, often in the range of multiple...
Recently, the Web has been rapidly "deepened" by many searchable databases online, where data are hidden behind query forms. For modelling and integrating Web databases,...