Summarizing large multidimensional datasets is a challenging task, often requiring extensive investigation by a user to identify overall trends and important exceptions to them. W...
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
Virtually all proposals for querying XML include a class of query we term "containment queries". It is also clear that in the foreseeable future, a substantial amount of...
Chun Zhang, Jeffrey F. Naughton, David J. DeWitt, ...
Conceptual-relational mappings between conceptual models and relational schemas have been used increasingly to achieve interoperability or overcome impedance mismatch in modern dat...
Multidimensional discrete data (MDD), i.e. arrays of arbitrary size, dimension and base type, occur in a variety of application elds. The object-oriented DBMS RasDaMan2 provides d...
Paula Furtado, Roland Ritsch, Norbert Widmann, Pet...