The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Ahmed Metwally: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ying Feng, Divyakant Agrawal, Amr El Abbadi, Ahmed Metwally
    Range CUBE: Efficient Cube Computation by Exploiting Data Correlation. [Citation Graph (0, 0)][DBLP]
    ICDE, 2004, pp:658-670 [Conf]
  2. Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi
    Efficient Computation of Frequent and Top-k Elements in Data Streams. [Citation Graph (0, 0)][DBLP]
    ICDT, 2005, pp:398-412 [Conf]
  3. Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi
    Using Association Rules for Fraud Detection in Web Advertising Networks. [Citation Graph (0, 0)][DBLP]
    VLDB, 2005, pp:169-180 [Conf]
  4. Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi
    Duplicate detection in click streams. [Citation Graph (0, 0)][DBLP]
    WWW, 2005, pp:12-21 [Conf]
  5. Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi
    An integrated efficient solution for computing frequent and top-k elements in data streams. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Database Syst., 2006, v:31, n:3, pp:1095-1133 [Journal]
  6. Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi, Qi Zheng
    On Hit Inflation Techniques and Detection in Streams of Web Advertising Networks. [Citation Graph (0, 0)][DBLP]
    ICDCS, 2007, pp:52- [Conf]
  7. Nagender Bandi, Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi
    TCAM-conscious Algorithms for Data Streams. [Citation Graph (0, 0)][DBLP]
    ICDE, 2007, pp:1342-1344 [Conf]
  8. Nagender Bandi, Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi
    Fast data stream algorithms using associative memories. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2007, pp:247-256 [Conf]
  9. Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi
    Detectives: detecting coalition hit inflation attacks in advertising networks streams. [Citation Graph (0, 0)][DBLP]
    WWW, 2007, pp:241-250 [Conf]

  10. Why go logarithmic if we can go linear?: Towards effective distinct counting of search traffic. [Citation Graph (, )][DBLP]


  11. Database Management as a Service: Challenges and Opportunities. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002