6650 search results - page 525 / 1330 » Mutating database queries |
177
click to vote
DBPL
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. The complexity of containment and satisfiability of conjunctive queries over finite, unranked, labeled trees is studied with respect to the axes Child, NextSibling, the...
216
click to vote
DAGSTUHL
1997
15 years 8 months ago
1997
In this paper we propose a data model for representing moving objects with uncertain positions in database systems. It is called the Moving Objects Spatio-Temporal (MOST) data mod...
337
click to vote
ICDE
2009
IEEE
16 years 8 months ago
2009
IEEE
Abstract-- When dealing with massive quantities of data, topk queries are a powerful technique for returning only the k most relevant tuples for inspection, based on a scoring func...
290
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
A k-NN query finds the k nearest-neighbors of a given point from a point database. When it is sufficient to measure object distance using the Euclidian distance, the key to effici...
189
click to vote
SIGMOD
2003
ACM
16 years 7 months ago
2003
ACM
A query optimizer compares alternative plans in its search space to find the best plan for a given query. Depending on the search space and the enumeration algorithm, optimizers v...