Among representative CBIR query schemes, query-by-sketch has been one of the attractive query tools that are highly adaptive to user's subjectivity.
It can also produce 2D cuts in any given plane, compute averages following diverse schemes and query a database of elastic constants to support meta-analyses.
We introduce storage methods, indexing schemes, and query processing techniques that scale to billions of triples across multiple nodes, while providing fast and easy access to the data through conventional query mechanisms such as SPARQL.
In our scheme, the query time is almost irrelevant to the number of friends.
Finally, we present a pilot Semantic Web-based system, ArgDF, through which users can create arguments using different argumentation schemes and can query arguments using a Semantic Web query language.
Therefore, the probability that a datacenter server DS can guess correctly the encrypted data of a group g i at the j th session is negligible when K i j ( = g k i j ) is revealed to DS. Song et al. [5] firstly proposed a cryptographic scheme which queries with encrypted keyword over encrypted data without decrypting anything by a server.
Furthermore, the square-root and proportional replication schemes provide higher query success ratio than the fixed copy approach with varying node density.
Current research on content-based image retrieval (CBIR) is centered on designing efficient query schemes in order to provide a user with effective mechanisms for image database search.
The compared query schemes are also different combinations of sequential, asynchronous and with or without aggregation algorithm.
To address this, in this paper, we propose a novel skyline query scheme termed MpSky.
A caching scheme that uses query predicates to cache data on the client-side in a client-server relational database system was presented in.
