default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmine Mhedhbi
Person information
- affiliation: University of Waterloo, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Amine Mhedhbi, Amol Deshpande, Semih Salihoglu:
Modern Techniques For Querying Graph-structured Databases. Found. Trends Databases 14(2): 72-185 (2024)- [i6]Karime Maamari, Amine Mhedhbi:
End-to-end Text-to-SQL Generation within an Analytics Insight Engine. CoRR abs/2406.12104 (2024) - [i5]Karime Maamari, Fadhil Abubaker, Daniel Jaroslawicz, Amine Mhedhbi:
The Death of Schema Linking? Text-to-SQL in the Age of Well-Reasoned Language Models. CoRR abs/2408.07702 (2024) - 2022
- [j6]Amine Mhedhbi, Semih Salihoglu:
Modern Techniques for Querying Graph-Structured Relations: Foundations, System Implementations, and Open Challenges. Proc. VLDB Endow. 15(12): 3762-3765 (2022) - 2021
- [j5]Pranjal Gupta, Amine Mhedhbi, Semih Salihoglu:
Columnar Storage and List-based Processing for Graph Database Management Systems. Proc. VLDB Endow. 14(11): 2491-2504 (2021) - [j4]Amine Mhedhbi, Chathura Kankanamge, Semih Salihoglu:
Optimizing One-time and Continuous Subgraph Queries using Worst-case Optimal Joins. ACM Trans. Database Syst. 46(2): 6:1-6:45 (2021) - [c3]Amine Mhedhbi, Pranjal Gupta, Shahid Khaliq, Semih Salihoglu:
A+ Indexes: Tunable and Space-Efficient Adjacency Lists in Graph Database Management Systems. ICDE 2021: 1464-1475 - [c2]Amine Mhedhbi, Matteo Lissandrini
, Laurens Kuiper, Jack Waudby, Gábor Szárnyas:
LSQB: a large-scale subgraph query benchmark. GRADES-NDA@SIGMOD 2021: 8:1-8:11 - [i4]Pranjal Gupta, Amine Mhedhbi, Semih Salihoglu:
Integrating Column-Oriented Storage and Query Processing Techniques Into Graph Database Management Systems. CoRR abs/2103.02284 (2021) - 2020
- [j3]Siddhartha Sahu, Amine Mhedhbi, Semih Salihoglu, Jimmy Lin, M. Tamer Özsu:
The ubiquity of large graphs and surprising challenges of graph processing: extended survey. VLDB J. 29(2-3): 595-618 (2020) - [i3]Amine Mhedhbi, Pranjal Gupta, Shahid Khaliq, Semih Salihoglu:
A+ Indexes: Lightweight and Highly Flexible Adjacency Lists for Graph Database Management Systems. CoRR abs/2004.00130 (2020)
2010 – 2019
- 2019
- [j2]Amine Mhedhbi, Semih Salihoglu:
Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins. Proc. VLDB Endow. 12(11): 1692-1704 (2019) - [i2]Amine Mhedhbi, Semih Salihoglu:
Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins. CoRR abs/1903.02076 (2019) - 2017
- [j1]Siddhartha Sahu, Amine Mhedhbi, Semih Salihoglu, Jimmy Lin, M. Tamer Özsu:
The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing. Proc. VLDB Endow. 11(4): 420-431 (2017) - [c1]Chathura Kankanamge, Siddhartha Sahu, Amine Mhedhbi, Jeremy Chen, Semih Salihoglu:
Graphflow: An Active Graph Database. SIGMOD Conference 2017: 1695-1698 - [i1]Siddhartha Sahu, Amine Mhedhbi, Semih Salihoglu, Jimmy Lin, M. Tamer Özsu:
The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing: A User Survey. CoRR abs/1709.03188 (2017)
Coauthor Index
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.
last updated on 2024-11-04 21:42 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
