511 search results - page 85 / 103 » Approximate Selection Queries over Imprecise Data |
130
click to vote
BIBE
2008
IEEE
15 years 6 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ï...
109
click to vote
DEXA
2008
Springer
15 years 1 months ago
2008
Springer
We address the problem of maintaining continuous skyline queries efficiently over dynamic objects with d dimensions. Skyline queries are an important new search capability for mult...
104
click to vote
SSDBM
2010
IEEE
14 years 9 months ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
CCS
2006
ACM
15 years 3 months ago
2006
ACM
Searchable symmetric encryption (SSE) allows a party to outsource the storage of his data to another party in a private manner, while maintaining the ability to selectively search...
SIGMOD
1996
ACM
15 years 3 months ago
1996
ACM
METU INteroperable Database System (MIND) is a multidatabase system that aims at achieving interoperability among heterogeneous, federated DBMSs. MIND architecture is based on OMG...