365 search results - page 46 / 73 » Answering Non-Monotonic Queries in Relational Data Exchange |
124
click to vote
DAWAK
2005
Springer
15 years 1 months ago
2005
Springer
Abstract. Data mining is an iterative process. Users issue series of similar data mining queries, in each consecutive run slightly modifying either the definition of the mined dat...
179
click to vote
PODS
2009
ACM
16 years 11 days ago
2009
ACM
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
178
click to vote
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
Data collections often have inconsistencies that arise due to a variety of reasons, and it is desirable to be able to identify and resolve them efficiently. Set similarity queries ...
SIGMOD
2004
ACM
15 years 12 months ago
2004
ACM
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
125
click to vote
JUCS
2010
14 years 6 months ago
2010
: We develop and study the concept of dataflow process networks as used for example by Kahn to suit exact computation over data types related to real numbers, such as continuous fu...