Sebastian Breß
Applied Filters
- Sebastian Breß
- AuthorRemove filter
People
Colleagues
- Sebastian Breß (23)
- Volker Markl (17)
- Tilmann Rabl (12)
- Gunter Saake (5)
- Steffen Zeuch (5)
- Asterios Katsifodimos (4)
- Clemens Lutz (4)
- Jonas Traub (4)
- Max Heimel (3)
- Andreas Kunft (2)
- Henning Funke (2)
- Jens Teubner (2)
- Ladjel Bellatreche (2)
- Martin Kiefer (2)
- Michael Saecker (2)
- Philipp Marian Grulich (2)
- Viktor Rosenfeld (2)
- Eike Schallehn (1)
- Jalil Boukhobza (1)
- Kai Uwe Sattler (1)
Publication
Proceedings/Book Names
- ADBIS'12: Proceedings of the 16th East European conference on Advances in Databases and Information Systems (1)
- DAMON '18: Proceedings of the 14th International Workshop on Data Management on New Hardware (1)
- DaMoN'19: Proceedings of the 15th International Workshop on Data Management on New Hardware (1)
- DEBS '19: Proceedings of the 13th ACM International Conference on Distributed and Event-based Systems (1)
- IDEAS '13: Proceedings of the 17th International Database Engineering & Applications Symposium (1)
- SIGMOD '16: Proceedings of the 2016 International Conference on Management of Data (1)
- SIGMOD '18: Proceedings of the 2018 International Conference on Management of Data (1)
- SIGMOD '20: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data (1)
- SIGMOD '22: Proceedings of the 2022 International Conference on Management of Data (1)
- SoCC '17: Proceedings of the 2017 Symposium on Cloud Computing (1)
- SoCC '18: Proceedings of the ACM Symposium on Cloud Computing (1)
- SSDBM '14: Proceedings of the 26th International Conference on Scientific and Statistical Database Management (1)
Publication Date
Export Citations
Publications
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articlePublished By ACMPublished By ACM
Triton Join: Efficiently Scaling to a Large Join State on GPUs with Fast Interconnects
- Clemens Lutz
Technische Universität Berlin, Berlin, Germany
, - Sebastian Breß
Snowflake, Berlin, Germany
, - Steffen Zeuch
DFKI GmbH, Berlin, Germany
, - Tilmann Rabl
HPI & University of Potsdam, Potsdam, Germany
, - Volker Markl
DFKI GmbH & Technische Universität Berlin, Berlin, Germany
SIGMOD '22: Proceedings of the 2022 International Conference on Management of Data•June 2022, pp 1017-1032• https://doi.org/10.1145/3514221.3517911Database management systems are facing growing data volumes. Previous research suggests that GPUs are well-equipped to quickly process joins and similar stateful operators, as GPUs feature high-bandwidth on-board memory. However, GPUs cannot scale joins ...
- 10Citation
- 755
- Downloads
MetricsTotal Citations10Total Downloads755Last 12 Months266Last 6 weeks19
- Clemens Lutz
- articlePublished By ACMPublished By ACM
Imperative or Functional Control Flow Handling: Why not the Best of Both Worlds?
- Gábor E. Gévay
TU Berlin
, - Tilmann Rabl
HPI, Uni Potsdam
, - Sebastian Breß
Snowflake Inc.
, - Loránd Madai-Tahy
mindsquare AG
, - Jorge-Arnulfo Quiané-Ruiz
TU Berlin, DFKI GmbH
, - Volker Markl
TU Berlin, DFKI GmbH
ACM SIGMOD Record, Volume 51, Issue 1•March 2022, pp 60-67 • https://doi.org/10.1145/3542700.3542715Modern data analysis tasks often involve control flow statements, such as the iterations in PageRank and K-means. To achieve scalability, developers usually implement these tasks in distributed dataflow systems, such as Spark and Flink. Designers of ...
- 1Citation
- 80
- Downloads
MetricsTotal Citations1Total Downloads80Last 12 Months29Last 6 weeks1
- Gábor E. Gévay
- surveyPublished By ACMPublished By ACM
Query Processing on Heterogeneous CPU/GPU Systems
- Viktor Rosenfeld
Technische Universität Berlin, Berlin, Germany
, - Sebastian Breß
Snowflake Inc., Berlin, Germany
, - Volker Markl
Technische Universität Berlin, Berlin, Germany
ACM Computing Surveys, Volume 55, Issue 1•January 2023, Article No.: 11, pp 1-38 • https://doi.org/10.1145/3485126Due to their high computational power and internal memory bandwidth, graphic processing units (GPUs) have been extensively studied by the database systems research community. A heterogeneous query processing system that employs CPUs and GPUs at the same ...
- 17Citation
- 3,759
- Downloads
MetricsTotal Citations17Total Downloads3,759Last 12 Months1,139Last 6 weeks129- 1
Supplementary Materialrosenfeld.zip
- Viktor Rosenfeld
- research-articlePublished By ACMPublished By ACM
Scotty: General and Efficient Open-source Window Aggregation for Stream Processing Systems
- Jonas Traub
Technische Universität Berlin, Germany
, - Philipp Marian Grulich
Technische Universität Berlin, Germany
, - Alejandro Rodríguez Cuéllar
Galápago Agroconsultores S.A.S., Bicaramanga, Colombia
, - Sebastian Breß
Technische Universität Berlin, Germany
, - Asterios Katsifodimos
Delft University of Technology, Netherlands
, - Tilmann Rabl
HPI, University of Potsdam, Germany
, - Volker Markl
Technische Universität Berlin & DFKI, Berlin, Germany
ACM Transactions on Database Systems, Volume 46, Issue 1•March 2021, Article No.: 1, pp 1-46 • https://doi.org/10.1145/3433675Window aggregation is a core operation in data stream processing. Existing aggregation techniques focus on reducing latency, eliminating redundant computations, or minimizing memory usage. However, each technique operates under different assumptions ...
- 11Citation
- 643
- Downloads
MetricsTotal Citations11Total Downloads643Last 12 Months86Last 6 weeks16
- Jonas Traub
- research-article
Scotch: generating FPGA-accelerators for sketching at line rate
- Martin Kiefer
Technische Universität Berlin
, - Ilias Poulakis
Technische Universität Berlin
, - Sebastian Breß
Technische Universität Berlin
, - Volker Markl
Technische Universität Berlin
Proceedings of the VLDB Endowment, Volume 14, Issue 3•November 2020, pp 281-293 • https://doi.org/10.14778/3430915.3430919Sketching algorithms are a powerful tool for single-pass data summarization. Their numerous applications include approximate query processing, machine learning, and large-scale network monitoring. In the presence of high-bandwidth interconnects or in-...
- 2Citation
- 84
- Downloads
MetricsTotal Citations2Total Downloads84Last 12 Months25Last 6 weeks3
- Martin Kiefer
- research-articlePublished By ACMPublished By ACM
Pump Up the Volume: Processing Large Data on GPUs with Fast Interconnects
- Clemens Lutz
DFKI GmbH, Berlin, Germany
, - Sebastian Breß
TU Berlin, Berlin, Germany
, - Steffen Zeuch
DFKI GmbH, Berlin, Germany
, - Tilmann Rabl
HPI, University of Potsdam, Potsdam, Germany
, - Volker Markl
DFKI GmbH, TU Berlin, Berlin, Germany
SIGMOD '20: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data•June 2020, pp 1633-1649• https://doi.org/10.1145/3318464.3389705GPUs have long been discussed as accelerators for database query processing because of their high processing power and memory bandwidth. However, two main challenges limit the utility of GPUs for large-scale data processing: (1) the on-board memory ...
- 54Citation
- 2,372
- Downloads
MetricsTotal Citations54Total Downloads2,372Last 12 Months477Last 6 weeks47- 1
Supplementary Material3318464.3389705.mp4
- Clemens Lutz
- research-articlePublished By ACMPublished By ACM
Performance Analysis and Automatic Tuning of Hash Aggregation on GPUs
- Viktor Rosenfeld
German Research Center for Artificial Intelligence
, - Sebastian Breß
German Research Center for Artificial Intelligence and Technische Universität Berlin
, - Steffen Zeuch
German Research Center for Artificial Intelligence and Technische Universität Berlin
, - Tilmann Rabl
Hasso Plattner Institute, University of Potsdam amd Technische Universität Berlin
, - Volker Markl
German Research Center for Artificial Intelligence and Technische Universität Berlin
DaMoN'19: Proceedings of the 15th International Workshop on Data Management on New Hardware•July 2019, Article No.: 8, pp 1-11• https://doi.org/10.1145/3329785.3329922Hash aggregation is an important data processing primitive which can be significantly accelerated by modern graphics processors (GPUs). Previous work derived heuristics for GPU-accelerated hash aggregation from the study of a particular GPU. In this ...
- 8Citation
- 200
- Downloads
MetricsTotal Citations8Total Downloads200Last 12 Months17Last 6 weeks2
- Viktor Rosenfeld
- research-article
An intermediate representation for optimizing machine learning pipelines
- Andreas Kunft
TU Berlin
, - Asterios Katsifodimos
Delft University of Technology
, - Sebastian Schelter
New York University
, - Sebastian Breß
DFKI and TU Berlin
, - Tilmann Rabl
Universität Potsdam
, - Volker Markl
DFKI
Proceedings of the VLDB Endowment, Volume 12, Issue 11•July 2019, pp 1553-1567 • https://doi.org/10.14778/3342263.3342633Machine learning (ML) pipelines for model training and validation typically include preprocessing, such as data cleaning and feature engineering, prior to training an ML model. Preprocessing combines relational algebra and user-defined functions (UDFs), ...
- 21Citation
- 745
- Downloads
MetricsTotal Citations21Total Downloads745Last 12 Months84Last 6 weeks7
- Andreas Kunft
- posterPublished By ACMPublished By ACM
Generating Reproducible Out-of-Order Data Streams
- Philipp M. Grulich
Technische Universitat Berlin
, - Jonas Traub
Technische Universitat Berlin and DFKI GmbH
, - Sebastian Breß
Technische Universitat Berlin and DFKI GmbH
, - Asterios Katsifodimos
Delft University of Technology
, - Volker Markl
Technische Universitat Berlin and DFKI GmbH
, - Tilmann Rabl
Hasso Plattner Institute and TU Berlin
DEBS '19: Proceedings of the 13th ACM International Conference on Distributed and Event-based Systems•June 2019, pp 256-257• https://doi.org/10.1145/3328905.3332511Evaluating modern stream processing systems in a reproducible manner requires data streams with different data distributions, data rates, and real-world characteristics such as delayed and out-of-order tuples. In this paper, we present an open source ...
- 11Citation
- 192
- Downloads
MetricsTotal Citations11Total Downloads192Last 12 Months14Last 6 weeks1
- Philipp M. Grulich
- research-articlePublished By ACMPublished By ACM
Data Management Systems Research at TU Berlin
- Ziawasch Abedjan
Technische Universität Berlin and DFKI Berlin, Berlin, Germany
, - Sebastian Breß
Technische Universität Berlin and DFKI Berlin, Berlin, Germany
, - Volker Markl
Technische Universität Berlin and DFKI Berlin, Berlin, Germany
, - Tilmann Rabl
Technische Universität Berlin and DFKI Berlin, Berlin, Germany
, - Juan Soto
Technische Universität Berlin and DFKI Berlin, Berlin, Germany
ACM SIGMOD Record, Volume 47, Issue 4•December 2018, pp 23-28 • https://doi.org/10.1145/3335409.3335415Data management systems research at TU Berlin is spearheaded by the Database Systems and Information Management (DIMA) Group, the Big Data Management (Big- DaMa) Group, as well as the affiliated Intelligent Analytics for Massive Data (IAM) Research ...
- 0Citation
- 155
- Downloads
MetricsTotal Citations0Total Downloads155Last 12 Months10Last 6 weeks1
- Ziawasch Abedjan
- research-article
Analyzing efficient stream processing on modern hardware
- Steffen Zeuch
German Research Center for Artificial Intelligence
, - Bonaventura Del Monte
German Research Center for Artificial Intelligence
, - Jeyhun Karimov
German Research Center for Artificial Intelligence
, - Clemens Lutz
German Research Center for Artificial Intelligence
, - Manuel Renz
German Research Center for Artificial Intelligence
, - Jonas Traub
Technische Universität Berlin
, - Sebastian Breß
Technische Universität Berlin and German Research Center for Artificial Intelligence
, - Tilmann Rabl
Technische Universität Berlin and German Research Center for Artificial Intelligence
, - Volker Markl
Technische Universität Berlin and German Research Center for Artificial Intelligence
Proceedings of the VLDB Endowment, Volume 12, Issue 5•January 2019, pp 516-530 • https://doi.org/10.14778/3303753.3303758Modern Stream Processing Engines (SPEs) process large data volumes under tight latency constraints. Many SPEs execute processing pipelines using message passing on shared-nothing architectures and apply a partition-based scale-out strategy to handle ...
- 36Citation
- 801
- Downloads
MetricsTotal Citations36Total Downloads801Last 12 Months79Last 6 weeks2
- Steffen Zeuch
- research-articlePublished By ACMPublished By ACM
ScootR: Scaling R Dataframes on Dataflow Systems
- Andreas Kunft
Technische Universität Berlin
, - Lukas Stadler
Oracle Labs
, - Daniele Bonetta
Oracle Labs
, - Cosmin Basca
Oracle Labs
, - Jens Meiners
Technische Universität Berlin
, - Sebastian Breß
DFKI GmbH
, - Tilmann Rabl
Technische Universität Berlin
, - Juan Fumero
The University of Manchester
, - Volker Markl
Technische Universität Berlin
SoCC '18: Proceedings of the ACM Symposium on Cloud Computing•October 2018, pp 288-300• https://doi.org/10.1145/3267809.3267813To cope with today's large scale of data, parallel dataflow engines such as Hadoop, and more recently Spark and Flink, have been proposed. They offer scalability and performance, but require data scientists to develop analysis pipelines in unfamiliar ...
- 3Citation
- 197
- Downloads
MetricsTotal Citations3Total Downloads197Last 12 Months11
- Andreas Kunft
- short-paperPublished By ACMPublished By ACM
Efficient k-means on GPUs
- Clemens Lutz
DFKI GmbH
, - Sebastian Breß
DFKI GmbH
, - Tilmann Rabl
TU Berlin
, - Steffen Zeuch
DFKI GmbH
, - Volker Markl
TU Berlin
DAMON '18: Proceedings of the 14th International Workshop on Data Management on New Hardware•June 2018, Article No.: 3, pp 1-3• https://doi.org/10.1145/3211922.3211925k-Means is a versatile clustering algorithm widely-used in practice. To cluster large data sets, state-of-the-art implementations use GPUs to shorten the data to knowledge time. These implementations commonly assign points on a GPU and update centroids ...
- 5Citation
- 232
- Downloads
MetricsTotal Citations5Total Downloads232Last 12 Months23Last 6 weeks2
- Clemens Lutz
- research-articlePublished By ACMPublished By ACM
Pipelined Query Processing in Coprocessor Environments
- Henning Funke
TU Dortmund University, Dortmund, Germany
, - Sebastian Breß
DFKI GmbH, Berlin, Germany
, - Stefan Noll
TU Dortmund University, Dortmund, Germany
, - Volker Markl
Technische Universität Berlin, Berlin, Germany
, - Jens Teubner
TU Dortmund University, Dortmund, Germany
SIGMOD '18: Proceedings of the 2018 International Conference on Management of Data•May 2018, pp 1603-1618• https://doi.org/10.1145/3183713.3183734Query processing on GPU-style coprocessors is severely limited by the movement of data. With teraflops of compute throughput in one device, even high-bandwidth memory cannot provision enough data for a reasonable utilization.
Query compilation is a ...
- 47Citation
- 816
- Downloads
MetricsTotal Citations47Total Downloads816Last 12 Months102Last 6 weeks8
- Henning Funke
- research-articlePublished By ACMPublished By ACM
Optimized on-demand data streaming from sensor nodes
- Jonas Traub
Technische Universität Berlin
, - Sebastian Breß
Technische Universität Berlin and German Research Center for Artificial Intelligence (DFKI)
, - Tilmann Rabl
Technische Universität Berlin and German Research Center for Artificial Intelligence (DFKI)
, - Asterios Katsifodimos
SAP Innovation Center
, - Volker Markl
Technische Universität Berlin and German Research Center for Artificial Intelligence (DFKI)
SoCC '17: Proceedings of the 2017 Symposium on Cloud Computing•September 2017, pp 586-597• https://doi.org/10.1145/3127479.3131621Real-time sensor data enables diverse applications such as smart metering, traffic monitoring, and sport analysis. In the Internet of Things, billions of sensor nodes form a sensor cloud and offer data streams to analysis systems. However, it is ...
- 21Citation
- 529
- Downloads
MetricsTotal Citations21Total Downloads529Last 12 Months9
- Jonas Traub
- research-article
Estimating join selectivities using bandwidth-optimized kernel density models
- Martin Kiefer
Technische Universität Berlin
, - Max Heimel
Snowflake Computing
, - Sebastian Breß
Technische Universität Berlin and German Research Center for Artificial Intelligence (DFKI)
, - Volker Markl
Technische Universität Berlin and German Research Center for Artificial Intelligence (DFKI)
Proceedings of the VLDB Endowment, Volume 10, Issue 13•September 2017, pp 2085-2096 • https://doi.org/10.14778/3151106.3151112Accurately predicting the cardinality of intermediate plan operations is an essential part of any modern relational query optimizer. The accuracy of said estimates has a strong and direct impact on the quality of the generated plans, and incorrect ...
- 33Citation
- 263
- Downloads
MetricsTotal Citations33Total Downloads263Last 12 Months59Last 6 weeks14
- Martin Kiefer
- research-articlePublished By ACMPublished By ACM
Robust Query Processing in Co-Processor-accelerated Databases
- Sebastian Breß
German Research Center for Artificial Intelligence, Berlin, Germany
, - Henning Funke
TU Dortmund University, Dortmund, Germany
, - Jens Teubner
TU Dortmund University, Dortmund, Germany
SIGMOD '16: Proceedings of the 2016 International Conference on Management of Data•June 2016, pp 1891-1906• https://doi.org/10.1145/2882903.2882936Technology limitations are making the use of heterogeneous computing devices much more than an academic curiosity. In fact, the use of such devices is widely acknowledged to be the only promising way to achieve application-speedups that users urgently ...
- 35Citation
- 852
- Downloads
MetricsTotal Citations35Total Downloads852Last 12 Months83Last 6 weeks12
- Sebastian Breß
- research-article
Load-aware inter-co-processor parallelism in database query processing
- Sebastian Breß
Otto von Guericke University Magdeburg, P.O. Box 4120, D-39016 Magdeburg, Germany
, - Norbert Siegmund
University of Passau, Germany
, - Max Heimel
Technische Universität Berlin, Germany
, - Michael Saecker
Technische Universität Berlin, Germany
, - Tobias Lauer
Jedox AG, Bismarckallee 7a, D-79098 Freiburg im Breisgau, Germany
, - Ladjel Bellatreche
LIAS/ISAE-ENSMA, 1 avenue Clément Ader BP 40109, F-86961 Futuroscope, France
, - Gunter Saake
Otto von Guericke University Magdeburg, P.O. Box 4120, D-39016 Magdeburg, Germany
Data & Knowledge Engineering, Volume 93, Issue C•September 2014, pp 60-79 • https://doi.org/10.1016/j.datak.2014.07.003For a decade, the database community has been exploring graphics processing units and other co-processors to accelerate query processing. While the developed algorithms often outperform their CPU counterparts, it is not beneficial to keep processing ...
- 6Citation
MetricsTotal Citations6
- Sebastian Breß
- research-article
Ocelot/HyPE: optimized data processing on heterogeneous hardware
- Sebastian Breß
TU Dortmund University and University of Magdeburg
, - Bastian Köcher
Technische Universität Berlin
, - Max Heimel
Technische Universität Berlin
, - Volker Markl
Technische Universität Berlin
, - Michael Saecker
Parstream GmbH
, - Gunter Saake
University of Magdeburg
Proceedings of the VLDB Endowment, Volume 7, Issue 13•August 2014, pp 1609-1612 • https://doi.org/10.14778/2733004.2733042The past years saw the emergence of highly heterogeneous server architectures that feature multiple accelerators in addition to the main processor. Efficiently exploiting these systems for data processing is a challenging research problem that comprises ...
- 12Citation
- 172
- Downloads
MetricsTotal Citations12Total Downloads172Last 12 Months17Last 6 weeks2
- Sebastian Breß
- research-articlePublished By ACMPublished By ACM
Toward efficient and reliable genome analysis using main-memory database systems
- Sebastian Dorok
University of Magdeburg, Germany
, - Sebastian Breß
University of Magdeburg, Germany
, - Horstfried Läpple
Bayer HealthCare AG, Germany
, - Gunter Saake
University of Magdeburg, Germany
SSDBM '14: Proceedings of the 26th International Conference on Scientific and Statistical Database Management•June 2014, Article No.: 34, pp 1-4• https://doi.org/10.1145/2618243.2618276Improvements in DNA sequencing technologies allow to sequence complete human genomes in a short time and at acceptable cost. Hence, the vision of genome analysis as standard procedure to support and improve medical treatment becomes reachable. In this ...
- 2Citation
- 122
- Downloads
MetricsTotal Citations2Total Downloads122Last 12 Months3Last 6 weeks1
- Sebastian Dorok
Author Profile Pages
- Description: The Author Profile Page initially collects all the professional information known about authors from the publications record as known by the ACM bibliographic database, the Guide. Coverage of ACM publications is comprehensive from the 1950's. Coverage of other publishers generally starts in the mid 1980's. The Author Profile Page supplies a quick snapshot of an author's contribution to the field and some rudimentary measures of influence upon it. Over time, the contents of the Author Profile page may expand at the direction of the community.
Please see the following 2007 Turing Award winners' profiles as examples: - History: Disambiguation of author names is of course required for precise identification of all the works, and only those works, by a unique individual. Of equal importance to ACM, author name normalization is also one critical prerequisite to building accurate citation and download statistics. For the past several years, ACM has worked to normalize author names, expand reference capture, and gather detailed usage statistics, all intended to provide the community with a robust set of publication metrics. The Author Profile Pages reveal the first result of these efforts.
- Normalization: ACM uses normalization algorithms to weigh several types of evidence for merging and splitting names.
These include:- co-authors: if we have two names and cannot disambiguate them based on name alone, then we see if they have a co-author in common. If so, this weighs towards the two names being the same person.
- affiliations: names in common with same affiliation weighs toward the two names being the same person.
- publication title: names in common whose works are published in same journal weighs toward the two names being the same person.
- keywords: names in common whose works address the same subject matter as determined from title and keywords, weigh toward being the same person.
The more conservative the merging algorithms, the more bits of evidence are required before a merge is made, resulting in greater precision but lower recall of works for a given Author Profile. Many bibliographic records have only author initials. Many names lack affiliations. With very common family names, typical in Asia, more liberal algorithms result in mistaken merges.
Automatic normalization of author names is not exact. Hence it is clear that manual intervention based on human knowledge is required to perfect algorithmic results. ACM is meeting this challenge, continuing to work to improve the automated merges by tweaking the weighting of the evidence in light of experience.
- Bibliometrics: In 1926, Alfred Lotka formulated his power law (known as Lotka's Law) describing the frequency of publication by authors in a given field. According to this bibliometric law of scientific productivity, only a very small percentage (~6%) of authors in a field will produce more than 10 articles while the majority (perhaps 60%) will have but a single article published. With ACM's first cut at author name normalization in place, the distribution of our authors with 1, 2, 3..n publications does not match Lotka's Law precisely, but neither is the distribution curve far off. For a definition of ACM's first set of publication statistics, see Bibliometrics
- Future Direction:
The initial release of the Author Edit Screen is open to anyone in the community with an ACM account, but it is limited to personal information. An author's photograph, a Home Page URL, and an email may be added, deleted or edited. Changes are reviewed before they are made available on the live site.
ACM will expand this edit facility to accommodate more types of data and facilitate ease of community participation with appropriate safeguards. In particular, authors or members of the community will be able to indicate works in their profile that do not belong there and merge others that do belong but are currently missing.
A direct search interface for Author Profiles will be built.
An institutional view of works emerging from their faculty and researchers will be provided along with a relevant set of metrics.
It is possible, too, that the Author Profile page may evolve to allow interested authors to upload unpublished professional materials to an area available for search and free educational use, but distinct from the ACM Digital Library proper. It is hard to predict what shape such an area for user-generated content may take, but it carries interesting potential for input from the community.
Bibliometrics
The ACM DL is a comprehensive repository of publications from the entire field of computing.
It is ACM's intention to make the derivation of any publication statistics it generates clear to the user.
- Average citations per article = The total Citation Count divided by the total Publication Count.
- Citation Count = cumulative total number of times all authored works by this author were cited by other works within ACM's bibliographic database. Almost all reference lists in articles published by ACM have been captured. References lists from other publishers are less well-represented in the database. Unresolved references are not included in the Citation Count. The Citation Count is citations TO any type of work, but the references counted are only FROM journal and proceedings articles. Reference lists from books, dissertations, and technical reports have not generally been captured in the database. (Citation Counts for individual works are displayed with the individual record listed on the Author Page.)
- Publication Count = all works of any genre within the universe of ACM's bibliographic database of computing literature of which this person was an author. Works where the person has role as editor, advisor, chair, etc. are listed on the page but are not part of the Publication Count.
- Publication Years = the span from the earliest year of publication on a work by this author to the most recent year of publication of a work by this author captured within the ACM bibliographic database of computing literature (The ACM Guide to Computing Literature, also known as "the Guide".
- Available for download = the total number of works by this author whose full texts may be downloaded from an ACM full-text article server. Downloads from external full-text sources linked to from within the ACM bibliographic space are not counted as 'available for download'.
- Average downloads per article = The total number of cumulative downloads divided by the number of articles (including multimedia objects) available for download from ACM's servers.
- Downloads (cumulative) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server since the downloads were first counted in May 2003. The counts displayed are updated monthly and are therefore 0-31 days behind the current date. Robotic activity is scrubbed from the download statistics.
- Downloads (12 months) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server over the last 12-month period for which statistics are available. The counts displayed are usually 1-2 weeks behind the current date. (12-month download counts for individual works are displayed with the individual record.)
- Downloads (6 weeks) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server over the last 6-week period for which statistics are available. The counts displayed are usually 1-2 weeks behind the current date. (6-week download counts for individual works are displayed with the individual record.)
ACM Author-Izer Service
Summary Description
ACM Author-Izer is a unique service that enables ACM authors to generate and post links on both their homepage and institutional repository for visitors to download the definitive version of their articles from the ACM Digital Library at no charge.
Downloads from these sites are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking to definitive version of ACM articles should reduce user confusion over article versioning.
ACM Author-Izer also extends ACM’s reputation as an innovative “Green Path” publisher, making ACM one of the first publishers of scholarly works to offer this model to its authors.
To access ACM Author-Izer, authors need to establish a free ACM web account. Should authors change institutions or sites, they can utilize the new ACM service to disable old links and re-authorize new links for free downloads from a different site.
How ACM Author-Izer Works
Authors may post ACM Author-Izer links in their own bibliographies maintained on their website and their own institution’s repository. The links take visitors to your page directly to the definitive version of individual articles inside the ACM Digital Library to download these articles for free.
The Service can be applied to all the articles you have ever published with ACM.
Depending on your previous activities within the ACM DL, you may need to take up to three steps to use ACM Author-Izer.
For authors who do not have a free ACM Web Account:
- Go to the ACM DL http://dl.acm.org/ and click SIGN UP. Once your account is established, proceed to next step.
For authors who have an ACM web account, but have not edited their ACM Author Profile page:
- Sign in to your ACM web account and go to your Author Profile page. Click "Add personal information" and add photograph, homepage address, etc. Click ADD AUTHOR INFORMATION to submit change. Once you receive email notification that your changes were accepted, you may utilize ACM Author-izer.
For authors who have an account and have already edited their Profile Page:
- Sign in to your ACM web account, go to your Author Profile page in the Digital Library, look for the ACM Author-izer link below each ACM published article, and begin the authorization process. If you have published many ACM articles, you may find a batch Authorization process useful. It is labeled: "Export as: ACM Author-Izer Service"
ACM Author-Izer also provides code snippets for authors to display download and citation statistics for each “authorized” article on their personal pages. Downloads from these pages are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking to the definitive version of ACM articles should reduce user confusion over article versioning.
Note: You still retain the right to post your author-prepared preprint versions on your home pages and in your institutional repositories with DOI pointers to the definitive version permanently maintained in the ACM Digital Library. But any download of your preprint versions will not be counted in ACM usage statistics. If you use these AUTHOR-IZER links instead, usage by visitors to your page will be recorded in the ACM Digital Library and displayed on your page.
FAQ
- Q. What is ACM Author-Izer?
A. ACM Author-Izer is a unique, link-based, self-archiving service that enables ACM authors to generate and post links on either their home page or institutional repository for visitors to download the definitive version of their articles for free.
- Q. What articles are eligible for ACM Author-Izer?
- A. ACM Author-Izer can be applied to all the articles authors have ever published with ACM. It is also available to authors who will have articles published in ACM publications in the future.
- Q. Are there any restrictions on authors to use this service?
- A. No. An author does not need to subscribe to the ACM Digital Library nor even be a member of ACM.
- Q. What are the requirements to use this service?
- A. To access ACM Author-Izer, authors need to have a free ACM web account, must have an ACM Author Profile page in the Digital Library, and must take ownership of their Author Profile page.
- Q. What is an ACM Author Profile Page?
- A. The Author Profile Page initially collects all the professional information known about authors from the publications record as known by the ACM Digital Library. The Author Profile Page supplies a quick snapshot of an author's contribution to the field and some rudimentary measures of influence upon it. Over time, the contents of the Author Profile page may expand at the direction of the community. Please visit the ACM Author Profile documentation page for more background information on these pages.
- Q. How do I find my Author Profile page and take ownership?
- A. You will need to take the following steps:
- Create a free ACM Web Account
- Sign-In to the ACM Digital Library
- Find your Author Profile Page by searching the ACM Digital Library for your name
- Find the result you authored (where your author name is a clickable link)
- Click on your name to go to the Author Profile Page
- Click the "Add Personal Information" link on the Author Profile Page
- Wait for ACM review and approval; generally less than 24 hours
- Q. Why does my photo not appear?
- A. Make sure that the image you submit is in .jpg or .gif format and that the file name does not contain special characters
- Q. What if I cannot find the Add Personal Information function on my author page?
- A. The ACM account linked to your profile page is different than the one you are logged into. Please logout and login to the account associated with your Author Profile Page.
- Q. What happens if an author changes the location of his bibliography or moves to a new institution?
- A. Should authors change institutions or sites, they can utilize ACM Author-Izer to disable old links and re-authorize new links for free downloads from a new location.
- Q. What happens if an author provides a URL that redirects to the author’s personal bibliography page?
- A. The service will not provide a free download from the ACM Digital Library. Instead the person who uses that link will simply go to the Citation Page for that article in the ACM Digital Library where the article may be accessed under the usual subscription rules.
However, if the author provides the target page URL, any link that redirects to that target page will enable a free download from the Service.
- Q. What happens if the author’s bibliography lives on a page with several aliases?
- A. Only one alias will work, whichever one is registered as the page containing the author’s bibliography. ACM has no technical solution to this problem at this time.
- Q. Why should authors use ACM Author-Izer?
- A. ACM Author-Izer lets visitors to authors’ personal home pages download articles for no charge from the ACM Digital Library. It allows authors to dynamically display real-time download and citation statistics for each “authorized” article on their personal site.
- Q. Does ACM Author-Izer provide benefits for authors?
- A. Downloads of definitive articles via Author-Izer links on the authors’ personal web page are captured in official ACM statistics to more accurately reflect usage and impact measurements.
Authors who do not use ACM Author-Izer links will not have downloads from their local, personal bibliographies counted. They do, however, retain the existing right to post author-prepared preprint versions on their home pages or institutional repositories with DOI pointers to the definitive version permanently maintained in the ACM Digital Library.
- Q. How does ACM Author-Izer benefit the computing community?
- A. ACM Author-Izer expands the visibility and dissemination of the definitive version of ACM articles. It is based on ACM’s strong belief that the computing community should have the widest possible access to the definitive versions of scholarly literature. By linking authors’ personal bibliography with the ACM Digital Library, user confusion over article versioning should be reduced over time.
In making ACM Author-Izer a free service to both authors and visitors to their websites, ACM is emphasizing its continuing commitment to the interests of its authors and to the computing community in ways that are consistent with its existing subscription-based access model.
- Q. Why can’t I find my most recent publication in my ACM Author Profile Page?
- A. There is a time delay between publication and the process which associates that publication with an Author Profile Page. Right now, that process usually takes 4-8 weeks.
- Q. How does ACM Author-Izer expand ACM’s “Green Path” Access Policies?
- A. ACM Author-Izer extends the rights and permissions that authors retain even after copyright transfer to ACM, which has been among the “greenest” publishers. ACM enables its author community to retain a wide range of rights related to copyright and reuse of materials. They include:
- Posting rights that ensure free access to their work outside the ACM Digital Library and print publications
- Rights to reuse any portion of their work in new works that they may create
- Copyright to artistic images in ACM’s graphics-oriented publications that authors may want to exploit in commercial contexts
- All patent rights, which remain with the original owner