Titlebook: Database Theory - ICDT‘99; 7th International Co Catriel Beeri,Peter Buneman Conference proceedings 1999 Springer-Verlag Berlin Heidelberg 1

Ardent

When Is “Nearest Neighbor” Meaningful?ar, most such techniques proposed in the literature are not evaluated versus simple linear scan, and are evaluated over workloads for which nearest neighbor is not meaningful. Often, even the reported experiments, when analyzed carefully, show that linear scan would outperform the techniques being p

negotiable

On Rectangular Partitionings in Two Dimensions: Algorithms, Complexity and Applicationsre approximation algorithms for several partitioning problems that provably approximate the optimal solutions within small constant factors, and that run in linear or close to linear time. We also establish the NP-hardness of several partitioning problems, therefore it is unlikely that there are eff

特征

Albumin

Novel Computational Approaches to Information Retrieval and Data Miningh for interesting patterns in data— we argue that a meaningful definition of “interesting” requires consideration of the optimization problem the enterprise is facing. This “microeconomic” view leads quickly to certain novel and interesting computational problems.

hangdog

Carcinogen

invade

helper-T-cells

發(fā)現(xiàn)

Schemas for Integration and Translation of Structured and Semi-structured Data of a middle-ware schema model. We present expressive and flexible schema definition languages, and investigate properties such as expressive power and the complexity of decision problems that are significant in the context of data translation and integration.

易改變

Ardeshir R. Rastinehad,Gopal H. Badlaniate how extending this class leads to undecidability. In addition to new areas, our work also has relevance to extensions of results for related problems such as query containment, trigger termination, implication of dependencies and reasoning in description logics.