default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAhmed Metwally 0001
Person information
- affiliation: Uber
- affiliation (former): Google Inc., Mountain View, CA, USA
- affiliation (PhD 2007): University of California, Santa Barbara, CA, USA
Other persons with the same name
- Ahmed Metwally 0002
![[0000-0002-0155-7412]](https://dblp.org/img/orcid-mark.12x12.png "0000-0002-0155-7412")
(aka: Ahmed A. Metwally) — Stanford University, CA, USA (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c17]Ahmed Metwally, Michael Shum:
Similarity Joins of Sparse Features. SIGMOD Conference Companion 2024: 80-92- 2023
- [j6]Fuheng Zhao, Divyakant Agrawal, Amr El Abbadi, Ahmed Metwally, Claire Mathieu, Michel de Rougemont:
Errata for \. Proc. VLDB Endow. 17(4): 643 (2023) - [i5]Fuheng Zhao, Divyakant Agrawal, Amr El Abbadi, Claire Mathieu, Ahmed Metwally, Michel de Rougemont:
A Detailed Analysis of the SpaceSaving± Family of Algorithms with Bounded Deletions. CoRR abs/2309.12623 (2023) - 2022
- [j5]Fuheng Zhao, Divy Agrawal, Amr El Abbadi, Ahmed Metwally:
SpaceSaving± An Optimal Algorithm for Frequency Estimation and Frequent items in the Bounded Deletion Model. Proc. VLDB Endow. 15(6): 1215-1227 (2022) - [c16]Ahmed Metwally:
Scaling Equi-Joins. SIGMOD Conference 2022: 2163-2176 - [i4]Ahmed Metwally:
Scaling and Load-Balancing Equi-Joins. CoRR abs/2209.08475 (2022) - 2021
- [i3]Fuheng Zhao, Divyakant Agrawal, Amr El Abbadi, Ahmed Metwally:
SpaceSaving±: An Optimal Algorithm for Frequency Estimation and Frequent items in the Bounded Deletion Model. CoRR abs/2112.03462 (2021)
2010 – 2019
- 2019
- [c15]Ahmed Metwally, Chun-Heng Huang:
Scalable Similarity Joins of Tokenized Strings. ICDE 2019: 1766-1777 - [i2]Ahmed Metwally, Chun-Heng Huang:
Scalable Similarity Joins of Tokenized Strings. CoRR abs/1903.09238 (2019) - 2018
- [r2]Ahmed Metwally:
Frequent Items on Streams. Encyclopedia of Database Systems (2nd ed.) 2018 - 2015
- [c14]Ahmed Metwally, Jia-Yu Pan, Minh Doan, Christos Faloutsos:
Scalable community discovery from multi-faceted graphs. IEEE BigData 2015: 1053-1062 - 2014
- [j4]Fatih Emekçi, Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi:
Dividing secrets to secure data outsourcing. Inf. Sci. 263: 198-210 (2014) - [p1]Ahmed Metwally, Fabio Soldo, Matt Paduano, Meenal Chhabra:
Large-Scale Network Traffic Analysis for Estimating the Size of IP Addresses and Detecting Traffic Anomalies. Large Scale and Big Data 2014: 435-462 - 2013
- [c13]Ye Wang, Ahmed Metwally, Srinivasan Parthasarathy:
Scalable all-pairs similarity search in metric spaces. KDD 2013: 829-837 - 2012
- [j3]Ahmed Metwally, Christos Faloutsos:
V-SMART-Join: A Scalable MapReduce Framework for All-Pair Similarity Joins of Multisets and Vectors. Proc. VLDB Endow. 5(8): 704-715 (2012) - [c12]Fabio Soldo, Ahmed Metwally:
Traffic anomaly detection based on the IP size distribution. INFOCOM 2012: 2005-2013 - [i1]Ahmed Metwally, Christos Faloutsos:
V-SMART-Join: A Scalable MapReduce Framework for All-Pair Similarity Joins of Multisets and Vectors. CoRR abs/1204.6077 (2012) - 2011
- [c11]Ahmed Metwally, Matt Paduano:
Estimating the number of users behind ip addresses for combating abusive traffic. KDD 2011: 249-257
2000 – 2009
- 2009
- [c10]Divyakant Agrawal, Amr El Abbadi, Fatih Emekçi, Ahmed Metwally:
Database Management as a Service: Challenges and Opportunities. ICDE 2009: 1709-1716 - [r1]Ahmed Metwally:
Frequent Items on Streams. Encyclopedia of Database Systems 2009: 1175-1179 - 2008
- [j2]Ahmed Metwally, Fatih Emekçi, Divyakant Agrawal, Amr El Abbadi:
SLEUTH: Single-pubLisher attack dEtection Using correlaTion Hunting. Proc. VLDB Endow. 1(2): 1217-1228 (2008) - [c9]Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi:
Why go logarithmic if we can go linear?: Towards effective distinct counting of search traffic. EDBT 2008: 618-629 - 2007
- [c8]Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi, Qi Zheng:
On Hit Inflation Techniques and Detection in Streams of Web Advertising Networks. ICDCS 2007: 52 - [c7]Nagender Bandi, Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi:
TCAM-conscious Algorithms for Data Streams. ICDE 2007: 1342-1344 - [c6]Nagender Bandi, Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi:
Fast data stream algorithms using associative memories. SIGMOD Conference 2007: 247-256 - [c5]Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi:
Detectives: detecting coalition hit inflation attacks in advertising networks streams. WWW 2007: 241-250 - 2006
- [j1]Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi:
An integrated efficient solution for computing frequent and top-k elements in data streams. ACM Trans. Database Syst. 31(3): 1095-1133 (2006) - 2005
- [c4]Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi:
Efficient Computation of Frequent and Top-k Elements in Data Streams. ICDT 2005: 398-412 - [c3]Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi:
Using Association Rules for Fraud Detection in Web Advertising Networks. VLDB 2005: 169-180 - [c2]Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi:
Duplicate detection in click streams. WWW 2005: 12-21 - 2004
- [c1]Ying Feng, Divyakant Agrawal, Amr El Abbadi, Ahmed Metwally:
Range CUBE: Efficient Cube Computation by Exploiting Data Correlation. ICDE 2004: 658-669
Coauthor Index
aka: Divy Agrawal
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-08-17 23:44 CEST 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:
