Similarity search is a primitive operation in database and Web search engines. With the advent of large-scale heterogeneous information networks that consist of multi-typed, interconnected objects, such as the bibliographic networks and social media networks, it is important to study similarity search in such networks. Intuitively, two objects are similar if they are linked by…
Proceedings of the VLDB Endowment Template
Write in a clean editor, then format for Proceedings of the VLDB Endowment in one click — DocuGuru applies the official ACM template with numbered references and exports a submission-ready PDF plus the editable LaTeX source. Free to start.
About the Proceedings of the VLDB Endowment format
Proceedings of the VLDB Endowment is a peer-reviewed journal published by ACM, covering Advanced Database Systems and Queries, Data Management and Algorithms, Cloud Computing and Resource Management.
| Publisher | ACM |
|---|---|
| Reference style | Numbered (ACM) Numbered — [1], [2] in the text [1] Ada Smith, Ben Jones, and Cara Lee. 2023. A representative article title. Proceedings of the VLDB Endowment 12, 3, Article 45 (2023).
Formats any DOI in Proceedings of the VLDB Endowment style. No sign-up. |
| Publishes research in | Advanced Database Systems and Queries Data Management and Algorithms Cloud Computing and Resource Management Advanced Data Storage Technologies Data Quality and Management |
| ISSN | 2150-8097 |
| Citation impact (2-yr) | 4.14 |
| h-index | 194 |
| i10-index | 2,916 |
| Total citations | 204,193 |
| Top institutions publishing here | Microsoft Research (United Kingdom) |
| Journal website | www.eecs.umich.edu |
| You get | A submission-ready PDF and the editable LaTeX source — ready to submit. |
Papers published in Proceedings of the VLDB Endowment per year
Citation impact of Proceedings of the VLDB Endowment by publication year
Citations each year’s papers have accumulated so far — the most recent years are still building up.
Most-cited papers in Proceedings of the VLDB Endowment
While high-level data parallel frameworks, like MapReduce, simplify the design and implementation of large-scale data processing systems, they do not naturally or efficiently support many important data mining and machine learning algorithms and can lead to inefficient learning systems. To help fill this critical void, we introduced the GraphLab abstraction which naturally expresses asynchronous, dynamic,…
The size of data sets being collected and analyzed in the industry for business intelligence is growing rapidly, making traditional warehousing solutions prohibitively expensive. Hadoop [3] is a popular open-source map-reduce implementation which is being used as an alternative to store and process extremely large data sets on commodity hardware. However, the map-reduce programming model…
The last decade has witnessed a tremendous growths of interests in applications that deal with querying and mining of time series data. Numerous representation methods for dimensionality reduction and similarity measures geared towards time series have been introduced. Each individual work introducing a particular method has made specific claims and, aside from the occasional theoretical…
Research in data stream algorithms has blossomed since late 90s. The talk will trace the history of the Approximate Frequency Counts paper, how it was conceptualized and how it influenced data stream research. The talk will also touch upon a recent development: analysis of personal data streams for improving our quality of lives.