1042 search results - page 118 / 209 » Constraint Databases, Data Structures and Efficient Query Ev... |
107
click to vote
EDBT
2008
ACM
16 years 2 months ago
2008
ACM
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...
144
click to vote
PODS
2006
ACM
16 years 2 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
136
click to vote
SIGMOD
2004
ACM
16 years 2 months ago
2004
ACM
We present new algorithms on commodity graphics processors to perform fast computation of several common database operations. Specifically, we consider operations such as conjunct...
148
click to vote
SIGMOD
2011
ACM
14 years 4 months ago
2011
ACM
Automatically generating sufficient database states is imperative to reduce human efforts in testing database applications. Complementing the traditional block or branch coverage...
152
click to vote
TKDE
2012
13 years 4 months ago
2012
— We present a query formulation language (called MashQL) in order to easily query and fuse structured data on the web. The main novelty of MashQL is that it allows people with l...