6654 search results - page 215 / 1331 » Querying Faceted Databases |
113
Voted
SSDBM
2010
IEEE
15 years 8 months ago
2010
IEEE
Many applications require to determine the k-nearest neighbors for multiple query points simultaneously. This task is known as all-(k)-nearest-neighbor (AkNN) query. In this paper,...
110
click to vote
KRDB
2003
15 years 5 months ago
2003
This paper introduces schema tuple queries and argues for their suitability in representing knowledge over standard relational databases. Schema tuple queries are queries that ret...
128
click to vote
FUIN
2008
15 years 3 months ago
2008
In this paper, we introduce preferential regular path queries. These are regular path queries whose symbols are annotated with preference weights for "scaling" up or down...
225
click to vote
ICDE
2008
IEEE
16 years 5 months ago
2008
IEEE
We study the problem of auditing a batch of SQL queries: Given a forbidden view of a database that should have been kept confidential, a batch of queries that were posed over this ...
224
click to vote
PODS
2009
ACM
16 years 4 months ago
2009
ACM
We consider the problem of deciding query equivalence for a conjunctive language in which queries output complex objects composed from a mixture of nested, unordered collection ty...