[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/800135.804398acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
Article
Free access

A near optimal data structure for a type of range query problem

Published: 30 April 1979 Publication History

Abstract

Let G denote the set of elements of a commutative group whose addition operations is denoted by +, let N be a positive integer, and let A(1),..., A(N) denote an array with values in G. We will be concerned with designing data structures for representing the array A, which facilitate efficient implementation of the following two on-line tasks:
(1) Update(j,x); replace A(j) by A(j) +x. (j and x are inputs, 1≤j≤N and xεG)
(2) Retrieve(j); returns the value of A(1) +...+ A(j). (j is an input, 1≤j≤N)
As a motivating example, let G be the group of integers with + denoting the usual addition operation. Imagine a standardized examination given to large numbers of individuals over an indefinite period of time. Assume that each examinee will attain an integer score in the interval [1,N]. If an individual gets j points, this fact is recorded by executing Update(j,1). so that A(j) represents the number of individuals to date having scored j points. In order to compute the percentile currently associated with a particular score k, we need the cumulative sum provided by executing Retrieve(k).

References

[1]
M. L. Fredman, "The complexity of maintaining an array and computing its partial sums", to appear.
[2]
M. L. Fredman, "A lower bound on the complexity of orthogonal range queries", to appear.
[3]
R. E. Tarjan, "Reference machines require non-linear time to maintain disjoint sets", Proc. 9th Annual Symp. on Theory of Computing, 18-29, (1977).
[4]
A. C. Yao, "Should tables be sorted?" Proc. 19th Annual Symp. on Foundations of Computer Science, 22-27, (1978).

Cited By

View all
  • (1980)Kraft storage and access for list implementations(Extended Abstract)Proceedings of the twelfth annual ACM symposium on Theory of computing10.1145/800141.804657(100-107)Online publication date: 28-Apr-1980
  • (1980)Multidimensional divide-and-conquerCommunications of the ACM10.1145/358841.35885023:4(214-229)Online publication date: 1-Apr-1980

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
STOC '79: Proceedings of the eleventh annual ACM symposium on Theory of computing
April 1979
364 pages
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 30 April 1979

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Acceptance Rates

STOC '79 Paper Acceptance Rate 37 of 111 submissions, 33%;
Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Upcoming Conference

STOC '25
57th Annual ACM Symposium on Theory of Computing (STOC 2025)
June 23 - 27, 2025
Prague , Czech Republic

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)52
  • Downloads (Last 6 weeks)6
Reflects downloads up to 03 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (1980)Kraft storage and access for list implementations(Extended Abstract)Proceedings of the twelfth annual ACM symposium on Theory of computing10.1145/800141.804657(100-107)Online publication date: 28-Apr-1980
  • (1980)Multidimensional divide-and-conquerCommunications of the ACM10.1145/358841.35885023:4(214-229)Online publication date: 1-Apr-1980

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media