منابع مشابه
Range queries in dynamic OLAP data cubes
A range query applies an aggregation operation (e.g., SUM) over all selected cells of an OLAP data cube where the selection is speci®ed by providing ranges of values for numeric dimensions. Range sum queries on data cubes are a powerful analysis tool. Many application domains require that data cubes are updated often and the information provided by analysis tools are current or ``near current''...
متن کاملRecursive Lists of Clusters: A Dynamic Data Structure for Range Queries in Metric Spaces
We introduce a novel data structure for solving the range query problem in generic metric spaces. It can be seen as a dynamic version of the List of Clusters data structure of Chávez and Navarro. Experimental results show that, with respect to range queries, it outperforms the original data structure when the database dimension is below 12. Moreover, the building process is much more efficient,...
متن کاملAn Efficiently Searchable Encrypted Data Structure for Range Queries
At CCS 2015 Naveed et al. presented first attacks on efficiently searchable encryption, such as deterministic and order-preserving encryption. These plaintext guessing attacks have been further improved in subsequent work, e.g. by Grubbs et al. in 2016. Such cryptanalysis is crucially important to sharpen our understanding of the implications of security models. In this paper we present an effi...
متن کاملDynamic Update Cube for Range-sum Queries
A range-sum query is very popular and becomes important in finding trends and in discovering relationships between attributes in diverse database applications. It sums over the selected cells of an OLAP data cube where target cells are decided by the specified query ranges. The direct method to access the data cube itself forces too many cells to be accessed, therefore it incurs a severe overhe...
متن کاملDynamic Planar Range Maxima Queries
We consider the dynamic two-dimensional maxima query problem. Let P be a set of n points in the plane. A point is maximal if it is not dominated by any other point in P . We describe two data structures that support the reporting of the t maximal points that dominate a given query point, and allow for insertions and deletions of points in P . In the pointer machine model we present a linear spa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 1982
ISSN: 0020-0190
DOI: 10.1016/0020-0190(82)90119-3