6905 search results - page 844 / 1381 » Querying Multidimensional Databases |
226
Voted
DOLAP
2005
ACM
15 years 9 months ago
2005
ACM
A novel framework for providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP is presented in this paper. Such a framework allows u...
204
click to vote
DAGSTUHL
2007
15 years 9 months ago
2007
Abstract. Moving objects produce trajectories, which are stored in databases by means of finite samples of time-stamped locations. When also speed limitations in these sample poin...
220
click to vote
DKE
2006
15 years 7 months ago
2006
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
192
click to vote
CORR
2007
Springer
15 years 7 months ago
2007
Springer
We address the problem of answering Web ontology queries efficiently. An ontology is formalized as a Deductive Ontology Base (DOB), a deductive database that comprises the ontology...
195
click to vote
IJCSA
2007
15 years 7 months ago
2007
Preference-based queries often referred to as skyline queries play an important role in cooperative query processing. However, their prohibitive result sizes pose a severe challen...