ON THE PERFORMANCE OF ORTHOGONAL RANGE QUERIES IN MULTIATTRIBUTE AND DOUBLY CHAINED TREES

被引：0
|
作者：
GARDY, D
FLAJOLET, P
PUECH, C
机构：
[1] ECOLE NORM SUPER, LIENS, CNRS, URA 1327, F-75231 PARIS 05, FRANCE
[2] INST NATL RECH INFORMAT & AUTOMAT, F-78150 LE CHESNAY, FRANCE
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1989年 / 382卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：218 / 229
页数：12
相关论文
共 50 条
  • [1] AVERAGE COST OF ORTHOGONAL RANGE QUERIES IN MULTIATTRIBUTE TREES
    GARDY, D
    FLAJOLET, P
    PUECH, C
    INFORMATION SYSTEMS, 1989, 14 (04) : 341 - 350
  • [2] OPTIMAL DYNAMIC MULTIATTRIBUTE HASHING FOR RANGE QUERIES
    HARRIS, EP
    RAMAMOHANARAO, K
    BIT, 1993, 33 (04): : 561 - 579
  • [3] NOTE ON OPTIMAL DOUBLY-CHAINED TREES
    KENNEDY, S
    COMMUNICATIONS OF THE ACM, 1972, 15 (11) : 997 - &
  • [4] PRACTICAL ASPECTS OF DOUBLY CHAINED TREES FOR RETRIEVAL
    STANFEL, LE
    JOURNAL OF THE ACM, 1972, 19 (03) : 425 - &
  • [5] Orthogonal range queries in OLAP
    Poon, CK
    DATABASE THEORY - ICDT 2001, PROCEEDINGS, 2001, 1973 : 361 - 374
  • [6] Dynamic orthogonal range queries in OLAP
    Poon, CK
    THEORETICAL COMPUTER SCIENCE, 2003, 296 (03) : 487 - 510
  • [7] On Cartesian Trees and Range Minimum Queries
    Demaine, Erik D.
    Landau, Gad M.
    Weimann, Oren
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT I, 2009, 5555 : 341 - +
  • [8] On Cartesian Trees and Range Minimum Queries
    Demaine, Erik D.
    Landau, Gad M.
    Weimann, Oren
    ALGORITHMICA, 2014, 68 (03) : 610 - 625
  • [9] On Cartesian Trees and Range Minimum Queries
    Erik D. Demaine
    Gad M. Landau
    Oren Weimann
    Algorithmica, 2014, 68 : 610 - 625
  • [10] Range mode and range median queries on lists and trees
    Krizanc, D
    Morin, P
    Smid, M
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2003, 2906 : 517 - 526
12345