default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 1,170 matches
- 2025
- Diego Arroyuelo, Adrián Gómez-Brandón, Gonzalo Navarro:
Evaluating regular path queries on compressed adjacency matrices. VLDB J. 34(1): 2 (2025) - Zheng Hu, Cong Xu, Weiguo Zheng:
A powerful reducing framework for accelerating set intersections over graphs. VLDB J. 34(1): 3 (2025) - Hao Liu, Raymond Chi-Wing Wong:
On efficient 3D object retrieval. VLDB J. 34(1): 4 (2025) - Dong Pan, Xu Zhou, Wensheng Luo, Zhibang Yang, Qing Li, Yunjun Gao, Kenli Li:
Accelerating maximum biplex search over large bipartite graphs. VLDB J. 34(1): 1 (2025) - 2024
- Shuhao Zhang, Juan Soto, Volker Markl:
A survey on transactional stream processing. VLDB J. 33(2): 451-479 (2024) - Jiayi Wang, Chengliang Chai, Jiabin Liu, Guoliang Li:
Cardinality estimation using normalizing flow. VLDB J. 33(2): 323-348 (2024) - Zhiwen Chen, Daokun Hu, Wenkui Che, Jianhua Sun, Hao Chen:
A quantitative evaluation of persistent memory hash indexes. VLDB J. 33(2): 375-397 (2024) - Alberto Abelló, James Cheney:
Eris: efficiently measuring discord in multidimensional sources. VLDB J. 33(2): 399-423 (2024) - Amir Aghasadeghi, Jan Van den Bussche, Julia Stoyanovich:
Temporal graph patterns by timed automata. VLDB J. 33(1): 25-47 (2024) - Diego Arroyuelo, Adrián Gómez-Brandón, Aidan Hogan, Gonzalo Navarro, Javiel Rojas-Ledesma:
Optimizing RPQs over a compact graph representation. VLDB J. 33(2): 349-374 (2024) - Matthias Boehm, Nesime Tatbul:
Special issue on "Machine learning and databases". VLDB J. 33(4): 901 (2024) - Jiwon Chang, Bohan Cui, Fatemeh Nargesian, Abolfazl Asudeh, H. V. Jagadish:
Data distribution tailoring revisited: cost-efficient integration of representative data. VLDB J. 33(5): 1283-1306 (2024) - Lijun Chang, Zhiyi Wang:
A near-optimal approach to edge connectivity-based hierarchical graph decomposition. VLDB J. 33(1): 49-71 (2024) - Xingguang Chen, Rong Zhu, Bolin Ding, Sibo Wang, Jingren Zhou:
Lero: applying learning-to-rank in query optimizer. VLDB J. 33(5): 1307-1331 (2024) - George Christodoulou, Panagiotis Bouros, Nikos Mamoulis:
HINT: a hierarchical interval index for Allen relationships. VLDB J. 33(1): 73-100 (2024) - Zhuochen Fan, Bowen Ye, Ziwei Wang, Zheng Zhong, Jiarui Guo, Yuhan Wu, Haoyu Li, Tong Yang, Yaofeng Tu, Zirui Liu, Bin Cui:
Enabling space-time efficient range queries with REncoder. VLDB J. 33(6): 1837-1859 (2024) - James Fang, Dmitry Lychagin, Michael J. Carey, Vassilis J. Tsotras:
A new window Clause for SQL++. VLDB J. 33(3): 595-623 (2024) - Muhammad Farhan, Henning Koehler, Qing Wang:
BatchHL+: batch dynamic labelling for distance queries on large-scale networks. VLDB J. 33(1): 101-129 (2024) - Marios Fragkoulis, Paris Carbone, Vasiliki Kalavri, Asterios Katsifodimos:
A survey on the evolution of stream processing systems. VLDB J. 33(2): 507-541 (2024) - Shufeng Gong, Chao Tian, Qiang Yin, Zhengdong Wang, Song Yu, Yanfeng Zhang, Wenyuan Yu, Liang Geng, Chong Fu, Ge Yu, Jingren Zhou:
Ingress: an automated incremental graph processing system. VLDB J. 33(3): 781-806 (2024) - Yizhang He, Kai Wang, Wenjie Zhang, Xuemin Lin, Ying Zhang:
Discovering critical vertices for reinforcement of large-scale bipartite networks. VLDB J. 33(6): 1861-1886 (2024) - Enhui Huang, Yanlei Diao, Anna Liu, Liping Peng, Luciano Di Palma:
Efficient and robust active learning methods for interactive database exploration. VLDB J. 33(4): 931-956 (2024) - Andy Huynh, Harshal A. Chaudhari, Evimaria Terzi, Manos Athanassoulis:
Towards flexibility and robustness of LSM trees. VLDB J. 33(4): 1105-1128 (2024) - Tong Jia, Ying Li, Yong Yang, Gang Huang:
Hilogx: noise-aware log-based anomaly detection with human feedback. VLDB J. 33(3): 883-900 (2024) - Jiawei Jiang, Shaoduo Gan, Bo Du, Gustavo Alonso, Ana Klimovic, Ankit Singla, Wentao Wu, Sheng Wang, Ce Zhang:
A systematic evaluation of machine learning on serverless infrastructure. VLDB J. 33(2): 425-449 (2024) - Jiawei Jiang, Yi Wei, Yu Liu, Wentao Wu, Chuang Hu, Zhigao Zheng, Ziyi Zhang, Yingxia Shao, Ce Zhang:
How good are machine learning clouds? Benchmarking two snapshots over 5 years. VLDB J. 33(3): 833-857 (2024) - Ahmet Kara, Milos Nikolic, Dan Olteanu, Haozhe Zhang:
F-IVM: analytics over relational databases under updates. VLDB J. 33(4): 903-929 (2024) - Reza Karegar, Melicaalsadat Mirsafian, Parke Godfrey, Lukasz Golab, Mehdi Kargar, Divesh Srivastava, Jaroslaw Szlichta:
Discovering approximate implicit domain orders through order dependencies. VLDB J. 33(5): 1257-1282 (2024) - Nikolai Karpov, Haoyu Zhang, Qin Zhang:
MinJoin++: a fast algorithm for string similarity joins under edit distance. VLDB J. 33(2): 281-299 (2024) - Xenophon Kitsios, Panagiotis Liakos, Katia Papakonstantinopoulou, Yannis Kotidis:
Flexible grouping of linear segments for highly accurate lossy compression of time series data. VLDB J. 33(5): 1569-1589 (2024)
skipping 1,140 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-12-25 14:39 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint