96 search results - page 17 / 20 » PTIME Queries Revisited |
CINQ
2004
Springer
14 years 1 months ago
2004
Springer
Algorithms for finding frequent itemsets fall into two broad classes: (1) algorithms that are based on non-trivial SQL statements to query and update a database, and (2) algorithms...
ECLIPSE
2007
ACM
13 years 11 months ago
2007
ACM
We present a declarative and visual debugging environment for Eclipse called JIVE.1 Traditional debugging is procedural in that a programmer must proceed step-by-step and objectby...
TCC
2009
Springer
14 years 8 months ago
2009
Springer
We consider the problem of memory checking, where a user wants to maintain a large database on a remote server but has only limited local storage. The user wants to use the small ...
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
In this paper we explore database segmentation in the context of a column-store DBMS targeted at a scientific database. We present a novel hardware- and scheme-oblivious segmentati...
COMPGEOM
2010
ACM
14 years 22 days ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...