USING BOOLEAN QUERIES WITH A CLUSTERED FILE ORGANIZATION

被引：2
|
作者：
CROFT, WB
机构：
来源：
JOURNAL OF THE AMERICAN SOCIETY FOR INFORMATION SCIENCE | 1979年 / 30卷 / 06期
关键词：
D O I：
10.1002/asi.4630300612
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：358 / 359
页数：2
相关论文
共 50 条
  • [21] FILE-ORGANIZATION USING COMPOSITE PERFECT HASHING
    RAMAKRISHNA, MV
    LARSON, PA
    ACM TRANSACTIONS ON DATABASE SYSTEMS, 1989, 14 (02): : 231 - 263
  • [22] Processing OLAP queries in hierarchically clustered databases
    Theodoratos, D
    Tsois, A
    DATA & KNOWLEDGE ENGINEERING, 2003, 45 (02) : 205 - 224
  • [23] Almost all monotone Boolean functions are polynomially learnable using membership queries
    Shmulevich, I
    Korshunov, AD
    Astola, J
    INFORMATION PROCESSING LETTERS, 2001, 79 (05) : 211 - 213
  • [24] Secure Federated Boolean Count Queries Using Fully-Homomorphic Cryptography
    Leighton, Alexander T.
    Yu, Yun William
    RESEARCH IN COMPUTATIONAL MOLECULAR BIOLOGY, RECOMB 2024, 2024, 14758 : 54 - 67
  • [25] FILE ORGANIZATION TECHNIQUES
    不详
    IEEE COMPUTER GROUP NEWS, 1970, 3 (02): : 6 - &
  • [26] PERSONAL FILE ORGANIZATION
    WARNER, TB
    IEEE TRANSACTIONS ON EDUCATION, 1972, E 15 (03) : 191 - &
  • [27] On the Power of Parity Queries in Boolean Decision Trees
    Kulkarni, Raghav
    Qiao, Youming
    Sun, Xiaoming
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION (TAMC 2015), 2015, 9076 : 99 - 109
  • [28] On the power of parity queries in boolean decision trees
    Centre for Quantum Technologies, The National University of Singapore, Singapore, Singapore
    不详
    Lect. Notes Comput. Sci., (99-109):
  • [29] Learning Boolean queries for article quality filtering
    Aphinyanaphongs, Y
    Aliferis, C
    MEDINFO 2004: PROCEEDINGS OF THE 11TH WORLD CONGRESS ON MEDICAL INFORMATICS, PT 1 AND 2, 2004, 107 : 263 - 267
  • [30] Web log file analysis: backlinks and queries
    Thelwall, M
    ASLIB PROCEEDINGS, 2001, 53 (06): : 217 - 223
12345