Sciweavers

6650 search results - page 1072 / 1330
» Mutating database queries
Sort
View
VLDB
1998
ACM
101views Database» more  VLDB 1998»
15 years 11 months ago
On Optimal Node Splitting for R-trees
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
Yván J. García, Mario A. Lopez, Scot...
EDBT
2009
ACM
156views Database» more  EDBT 2009»
15 years 10 months ago
Efficient skyline retrieval with arbitrary similarity measures
A skyline query returns a set of objects that are not dominated by other objects. An object is said to dominate another if it is closer to the query than the latter on all factors...
Deepak P, Prasad M. Deshpande, Debapriyo Majumdar,...
CIDR
2003
125views Algorithms» more  CIDR 2003»
15 years 8 months ago
Crossing the Structure Chasm
It has frequently been observed that most of the world’s data lies outside database systems. The reason is that database systems focus on structured data, leaving the unstructur...
Alon Y. Halevy, Oren Etzioni, AnHai Doan, Zachary ...
EFDBS
2001
15 years 8 months ago
Augmenting SQL with Dynamic Restructuring to Support Interoperability in a Relational Federation
In this work, we consider augmenting SQL with constructs allowing dynamic restructuring. Dynamic restructuring occurs naturally in a framework including second-order capabilities f...
Catharine M. Wyss, Felix I. Wyss, Dirk Van Gucht
ALGORITHMICA
2002
103views more  ALGORITHMICA 2002»
15 years 6 months ago
Efficient Bulk Operations on Dynamic R-Trees
In recent years there has been an upsurge of interest in spatial databases. A major issue is how to manipulate efficiently massive amounts of spatial data stored on disk in multidi...
Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey...
« Prev « First page 1072 / 1330 Last » Next »