1567 search results - page 294 / 314 » Compressing Relations and Indexes |
SIGMOD
2007
ACM
14 years 9 months ago
2007
ACM
The Boolean semantics of SQL queries cannot adequately capture the "fuzzy" preferences and "soft" criteria required in non-traditional data retrieval applicati...
SIGMOD
2006
ACM
14 years 9 months ago
2006
ACM
Text is ubiquitous and, not surprisingly, many important applications rely on textual data for a variety of tasks. As a notable example, information extraction applications derive...
SIGMOD
2003
ACM
14 years 9 months ago
2003
ACM
Most relational query optimizers make use of information about the costs of accessing tuples and data structures on various storage devices. This information can at times be off b...
SIGMOD
2002
ACM
14 years 9 months ago
2002
ACM
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
EDBT
2008
ACM
14 years 9 months ago
2008
ACM
Peer Data Management Systems (PDMSs) have been introduced as a solution to the problem of large-scale sharing of semantically rich data. A PDMS consists of semantic peers connecte...