{"title":"分位数摘要的空间高效在线计算","authors":"Michael Greenwald, S. Khanna","doi":"10.1145/376284.375670","DOIUrl":null,"url":null,"abstract":"An -approximate quantile summary of a sequence of N elements is a data structure that can answer quantile queries about the sequence to within a precision of N. We present a new online algorithm fo...","PeriodicalId":49524,"journal":{"name":"Sigmod Record","volume":"1 1","pages":""},"PeriodicalIF":0.9000,"publicationDate":"2001-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1145/376284.375670","citationCount":"67","resultStr":"{\"title\":\"Space-efficient online computation of quantile summaries\",\"authors\":\"Michael Greenwald, S. Khanna\",\"doi\":\"10.1145/376284.375670\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An -approximate quantile summary of a sequence of N elements is a data structure that can answer quantile queries about the sequence to within a precision of N. We present a new online algorithm fo...\",\"PeriodicalId\":49524,\"journal\":{\"name\":\"Sigmod Record\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2001-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1145/376284.375670\",\"citationCount\":\"67\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Sigmod Record\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1145/376284.375670\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Sigmod Record","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1145/376284.375670","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
Space-efficient online computation of quantile summaries
An -approximate quantile summary of a sequence of N elements is a data structure that can answer quantile queries about the sequence to within a precision of N. We present a new online algorithm fo...
期刊介绍:
SIGMOD investigates the development and application of database technology to support the full range of data management needs. The scope of interests and members is wide with an almost equal mix of people from industryand academia. SIGMOD sponsors an annual conference that is regarded as one of the most important in the field, particularly for practitioners.
Areas of Special Interest:
Active and temporal data management, data mining and models, database programming languages, databases on the WWW, distributed data management, engineering, federated multi-database and mobile management, query processing & optimization, rapid application development tools, spatial data management, user interfaces.