435 search results - page 9 / 87 » Querying Inconsistent Databases: Algorithms and Implementati... |
BIBE
2008
IEEE
14 years 2 months ago
2008
IEEE
— This paper describes a design and implementation of the Smith-Waterman algorithm accelerated on the graphics processing unit (GPU). Our method is implemented using compute uniï...
SIGMOD
2000
ACM
13 years 7 months ago
2000
ACM
In this paper we describe XXL (eXtensible and fleXible Library), a toolkit for rapid prototyping query processing algorithms. XXL is a flexible, high-level, platform independent J...
DATESO
2009
13 years 5 months ago
2009
Top trees are a dynamic self-adjusting data structure that can be used by any tree algorithm. Actually, an arbitrary number of different tree algorithms can use a single structure....
ADBIS
2000
Springer
13 years 12 months ago
2000
Springer
Queries involving aggregation are typical in a number of database research areas, such as data warehousing, global information systems and mobile computing. One of the main ideas ...
DASFAA
2010
IEEE
13 years 12 months ago
2010
IEEE
xml keyword search provides a simple and user-friendly way of retrieving data from xml databases, but the ambiguities of keywords make it difficult to effectively answer keyword qu...