662 search results - page 39 / 133 » A comparative benchmark of large objects in relational datab... |
CLUSTER
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— As the datasets used to fuel modern scientific discovery grow increasingly large, they become increasingly difficult to manage using conventional software. Parallel d...
SMI
2008
IEEE
14 years 2 months ago
2008
IEEE
In this paper we propose a novel algorithm for 3D shape searching based on the visual similarity by cutting the object into sections. This method rectifies some of the shortcomin...
BMCBI
2010
13 years 5 months ago
2010
Background: We propose a sequence clustering algorithm and compare the partition quality and execution time of the proposed algorithm with those of a popular existing algorithm. T...
BTW
1999
Springer
13 years 12 months ago
1999
Springer
Conceptual Information Systems provide a multi-dimensional conceptually structured view on data stored in relational databases. On restricting the expressiveness of the retrieval l...
OOPSLA
1999
Springer
13 years 12 months ago
1999
Springer
We describe how reachability-based orthogonal persistence can be supported even in uncooperative implementations of languages such as C++ and Modula-3, and without modification t...