Back to Results
First PageMeta Content
Bin / Fractional cascading / Closest pair of points problem / R-tree / FO / Voronoi diagram / Discrete mathematics / Mathematics / Geometry / Computational geometry


CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Data Structures for Range-Aggregate Extent Queries Prosenjit Gupta∗ Ravi Janardan†
Add to Reading List

Document Date: 2008-10-29 00:05:03

Open Document

File Size: 134,40 KB

Share Result on Facebook

City

Berlin / Minneapolis / Hyderabad / /

Company

Mentor Graphics / Database Systems / /

Country

United States / Canada / India / /

/

Facility

Prentice Hall / We store S / International Institute of Information Technology / Carleton University / We store / /

IndustryTerm

balanced binary search tree storing / query-timeefficient solutions / balanced binary search trees / aggregate processing / /

Organization

School of Computer Science / Carleton University / Ottawa / National Science Foundation / International Institute of Information Technology / Univ. of Minnesota / /

Person

D. Zhang / V / A. Markowetz / V / /

ProvinceOrState

Minnesota / Ontario / /

PublishedMedium

Theory of Computing / /

Technology

data warehouse / Information Technology / /

URL

www.iiit.net/techreports/2007 / http /

SocialTag