1611 search results - page 213 / 323 » Supporting Exploratory Queries in Databases |
223
click to vote
ICDE
2005
IEEE
16 years 5 months ago
2005
IEEE
We consider the problem of efficiently computing the skyline against the most recent N elements in a data stream seen so far. Specifically, we study the n-of-N skyline queries; th...
136
click to vote
STOC
2010
ACM
15 years 9 months ago
2010
ACM
We define a new interactive differentially private mechanism — the median mechanism — for answering arbitrary predicate queries that arrive online. Given fixed accuracy and...
144
click to vote
SIGMOD
1999
ACM
15 years 8 months ago
1999
ACM
Computing multidimensional aggregates in high dimensions is a performance bottleneck for many OLAP applications. Obtaining the exact answer to an aggregation query can be prohibit...
251
click to vote
SIGIR
1998
ACM
15 years 3 months ago
1998
ACM
Ranked queries are used to locate relevant documents in text databases. In a ranked query a list of terms is specified, then the documents that most closely match the query are re...
145
click to vote
VLDB
1999
ACM
15 years 8 months ago
1999
ACM
Microsoft SQL Server was successful for many years for transaction processing and decision support workloads with neither merge join nor hash join, relying entirely on nested loop...