We present a valid-time extension of SQL and investigate its efficient implementation on an Object-Relational database system. We propose an approach where temporal queries are ex...
Abstract. The Evolutionary Geometric Near-neighbor Access Tree (EGNAT) is a recently proposed data structure that is suitable for indexing large collections of complex objects. It ...
Most relational query optimizers make use of information about the costs of accessing tuples and data structures on various storage devices. This information can at times be off b...
Abstract: In order to achieve efficient execution plans for queries comprising userdefined data types and predicates, the database system has to be provided with appropriate index ...
Abstract. We propose an original solution for the general reverse k-nearest neighbor (RkNN) search problem in Euclidean spaces. Compared to the limitations of existing methods for ...