Thumbnail
Access Restriction
Subscribed

Author Willard, Dan E.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1987
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract An orthogonal query that asks to aggregate the set of records in $\textit{k}-dimensional$ box regions is studied, and it is shown that space $\textit{O}(\textit{N}((log$ $\textit{N})/(log$ log $\textit{N}))\textit{k}-1)$ makes possible a combined time complexity $\textit{O}(log\textit{kN}$ ) for retrievals, insertions, and deletions.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1987-10-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 34
Issue Number 4
Page Count 13
Starting Page 846
Ending Page 858


Open content in new tab

   Open content in new tab
Source: ACM Digital Library