189 search results - page 15 / 38 » Answering general time sensitive queries |
CCS
2008
ACM
13 years 9 months ago
2008
ACM
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...
SIGMOD
2007
ACM
14 years 7 months ago
2007
ACM
Complex queries often contain common or similar subexpressions, either within a single query or among multiple queries submitted as a batch. If so, query execution time can be imp...
VLDB
2007
ACM
14 years 1 months ago
2007
ACM
The general problem of answering top-k queries can be modeled using lists of data items sorted by their local scores. The most efficient algorithm proposed so far for answering to...
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
A common criticism of database systems is that they are hard to query for users uncomfortable with a formal query language. To address this problem, form-based interfaces and keyw...
SEMWEB
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. This paper presents a decidable fragment for combining ontologies and rules in order-sorted logic programming. We describe ordersorted logic programming with sort, predic...