Alex Thomo

Proceedings of the Advanced Information Networking and Applications, 2021

Triangle Enumeration for Billion-Scale Graphs in RDBMS.

[BibT_eX]

[DOI]

Aly Ahmed

Keanelek Enns

Proceedings of the Advanced Information Networking and Applications, 2021

2020

Suffix Rank: a new scalable algorithm for indexing large string collections.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2020

Utility-Based Graph Summarization: New and Improved.

[BibT_eX]

[DOI]

CoRR, 2020

Provenance for Regular Path Queries.

[BibT_eX]

[DOI]

CoRR, 2020

Vectorising k-Core Decomposition for GPU Acceleration.

[BibT_eX]

[DOI]

Amir Mehrafsa

Sean Chester

Proceedings of the SSDBM 2020: 32nd International Conference on Scientific and Statistical Database Management, 2020

Triangle Enumeration on Massive Graphs Using AWS Lambda Functions.

[BibT_eX]

[DOI]

Tengkai Yu

Proceedings of the Advances in Intelligent Networking and Collaborative Systems - The 12th International Conference on Intelligent Networking and Collaborative Systems (INCoS-2020), Victoria, BC, Canada, 31 August, 2020

PageRank for Billion-Scale Networks in RDBMS.

[BibT_eX]

[DOI]

Aly Ahmed

Reverse Prevention Sampling for Misinformation Mitigation in Social Networks.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Database Theory, 2020

Strongly Minimal MapReduce Algorithms: A TeraSort Case Study.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Information and Knowledge Systems, 2020

Efficient Enumeration of Four Node Graphlets at Trillion-Scale.

[BibT_eX]

[DOI]

Yudi Santoso

Proceedings of the 23rd International Conference on Extending Database Technology, 2020

2019

Graph-XLL: a Graph Library for Extra Large Graph Analytics on a Single Machine.

[BibT_eX]

[DOI]

Jian Wu

Proceedings of the 10th International Conference on Information, 2019

Triad Enumeration at Trillion-Scale Using a Single Commodity Machine.

[BibT_eX]

[DOI]

Proceedings of the Advances in Database Technology, 2019

Fast Truss Decomposition in Large-scale Probabilistic Graphs.

[BibT_eX]

[DOI]

Proceedings of the Advances in Database Technology, 2019

Efficient Computation of Probabilistic Core Decomposition at Web-Scale.

[BibT_eX]

[DOI]

Proceedings of the Advances in Database Technology, 2019

2018

Social Web Search.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Social Network Analysis and Mining, 2nd Edition, 2018

Anonymization and De-anonymization of Social Network Data.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Social Network Analysis and Mining, 2nd Edition, 2018

Scalable Misinformation Prevention in Social Networks.

[BibT_eX]

[DOI]

CoRR, 2018

NoSingles: a space-efficient algorithm for influence maximization.

[BibT_eX]

[DOI]

Diana Popova

Naoto Ohsaka

Ken-ichi Kawarabayashi

Proceedings of the 30th International Conference on Scientific and Statistical Database Management, 2018

Data Structures for Efficient Computation of Influence Maximization and Influence Estimation.

[BibT_eX]

[DOI]

Diana Popova

Akshay Khot

Proceedings of the 21st International Conference on Extending Database Technology, 2018

K-Truss Decomposition of Large Networks on a Single Consumer-Grade Machine.

[BibT_eX]

[DOI]

Proceedings of the IEEE/ACM 2018 International Conference on Advances in Social Networks Analysis and Mining, 2018

2017

Computing source-to-target shortest paths for complex networks in RDBMS.

[BibT_eX]

[DOI]

Aly Ahmed

J. Comput. Syst. Sci., 2017

Computation of K-Core Decomposition on Giraph.

[BibT_eX]

[DOI]

Fangming Liu

CoRR, 2017

Zero-Knowledge-Private Counting of Group Triangles in Social Networks.

[BibT_eX]

[DOI]

Comput. J., 2017

<i>k</i>-core Decomposition on Giraph and GraphChi.

[BibT_eX]

[DOI]

Proceedings of the Advances in Intelligent Networking and Collaborative Systems, 2017

Efficient Implementation of Anchored 2-core Algorithm.

[BibT_eX]

[DOI]

Babak Tootoonchi

Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017, Sydney, Australia, July 31, 2017

2016

Clearing Contamination in Large Networks.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2016

Conflict-Aware Weighted Bipartite B-Matching and Its Application to E-Commerce.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2016

Efficient Computation of Feedback Arc Set at Web-Scale.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2016

A new approach to distinguish migraine from stroke by mining structured and unstructured clinical data-sources.

[BibT_eX]

[DOI]

Netw. Model. Anal. Health Informatics Bioinform., 2016

ACon: A learning-based approach to deal with uncertainty in contextual requirements at runtime.

[BibT_eX]

[DOI]

Inf. Softw. Technol., 2016

Fuzzy joins in MapReduce: Edit and Jaccard distance.

[BibT_eX]

[DOI]

Ben Kimmett

Proceedings of the 7th International Conference on Information, 2016

Efficient Computation of Importance Based Communities in Web-Scale Networks Using a Single Machine.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM International Conference on Information and Knowledge Management, 2016

From Recommendation to Profile Inference (Rec2PI): A Value-added Service to Wi-Fi Data Mining.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM International Conference on Information and Knowledge Management, 2016

Group-Aware Weighted Bipartite B-Matching.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM International Conference on Information and Knowledge Management, 2016

An experimental evaluation of giraph and GraphChi.

[BibT_eX]

[DOI]

Junnan Lu

Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2016

2015

Fuzzy Joins in MapReduce: An Experimental Study.

[BibT_eX]

[DOI]

Ben Kimmett

S. Venkatesh

Proc. VLDB Endow., 2015

K-Core Decomposition of Large Networks on a Single PC.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2015

Erratum to: Mining clinical text for stroke prediction.

[BibT_eX]

[DOI]

Netw. Model. Anal. Health Informatics Bioinform., 2015

Mining clinical text for stroke prediction.

[BibT_eX]

[DOI]

Netw. Model. Anal. Health Informatics Bioinform., 2015

Dynamis: Effective Context-Aware Web Service Selection Using Dynamic Attributes.

[BibT_eX]

[DOI]

Future Internet, 2015

A model for learning the news in social networks.

[BibT_eX]

[DOI]

Krishnan Rajagopalan

Ann. Math. Artif. Intell., 2015

Mining Association Rules in the BCCA Liver Cancer Data Set.

[BibT_eX]

[DOI]

Fabiola M. R. Pinheiro

Mu-Hsing Kuo

Jeff Barnett

Proceedings of the Driving Quality in Informatics: Fulfilling the Promise, 2015

2014

Social Web Search.

[BibT_eX]

[DOI]

Encyclopedia of Social Network Analysis and Mining, 2014

Anonymization and De-anonymization of Social Network Data.

[BibT_eX]

[DOI]

Encyclopedia of Social Network Analysis and Mining, 2014

Computing k-Regret Minimizing Sets.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2014

Buyer to Seller Recommendation under Constraints.

[BibT_eX]

[DOI]

CoRR, 2014

Comparing the staples in latent factor models for recommender systems.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Applied Computing, 2014

A case study of applying data mining to sensor data for contextual requirements analysis.

[BibT_eX]

[DOI]

Proceedings of the IEEE 1st International Workshop on Artificial Intelligence for Requirements Engineering, 2014

Three-way joins on MapReduce: An experimental study.

[BibT_eX]

[DOI]

Ben Kimmett

S. Venkatesh

Proceedings of the 5th International Conference on Information, 2014

View-Based Tree-Language Rewritings for XML.

[BibT_eX]

[DOI]

Laks V. S. Lakshmanan

Proceedings of the Foundations of Information and Knowledge Systems, 2014

Zero-Knowledge Private Computation of Node Bridgeness in Social Networks.

[BibT_eX]

[DOI]

Proceedings of the Advanced Information Systems Engineering Workshops, 2014

Incorporating User Reviews as Implicit Feedback for Improving Recommender Systems.

[BibT_eX]

[DOI]

Yasamin Heshmat Dehkordi

Sudhakar Ganti

Proceedings of the 2014 IEEE Fourth International Conference on Big Data and Cloud Computing, 2014

Utilizing Favorites Lists for Better Recommendations.

[BibT_eX]

[DOI]

Mustafa Abualsaud

Tatiana Gutierrez-Bunster

Proceedings of the 2014 IEEE Fourth International Conference on Big Data and Cloud Computing, 2014

How do biological networks differ from social networks? (an experimental study).

[BibT_eX]

[DOI]

John Taylor

Proceedings of the 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2014

Semantic Graph Compression with Hypergraphs.

[BibT_eX]

[DOI]

Arber Borici

Proceedings of the 28th IEEE International Conference on Advanced Information Networking and Applications, 2014

2013

Trust prediction from user-item ratings.

[BibT_eX]

[DOI]

Nikolay Korovaiko

Soc. Netw. Anal. Min., 2013

Why Waldo befriended the dummy? k-Anonymization of social networks with pseudo-nodes.

[BibT_eX]

[DOI]

Soc. Netw. Anal. Min., 2013

Probabilistic Graph Summarization.

[BibT_eX]

[DOI]

Nasrin Hassanlou

Proceedings of the Web-Age Information Management - 14th International Conference, 2013

Differential Privacy: Improving Utility via Differential Noise.

[BibT_eX]

Proceedings of the 21st Italian Symposium on Advanced Database Systems, 2013

Extracting association rules from liver cancer data using the FP-growth algorithm.

[BibT_eX]

[DOI]

Fabiola M. R. Pinheiro

Mu-Hsing Kuo

Jeff Barnett

Proceedings of the IEEE 3rd International Conference on Computational Advances in Bio and Medical Sciences, 2013

Indexing Reverse Top-k Queries in Two Dimensions.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2013

Zero-knowledge private graph summarization.

[BibT_eX]

[DOI]

Jens H. Weber-Jahnke

Proceedings of the 2013 IEEE International Conference on Big Data (IEEE BigData 2013), 2013

LINK RECOMMENDER: Collaborative-Filtering for Recommending URLs to Twitter Users.

[BibT_eX]

[DOI]

Nazpar Yazdanfar

Proceedings of the 4th International Conference on Ambient Systems, 2013

2012

Regular Path Queries on Graph-Structured Data.

[BibT_eX]

[DOI]

S. Venkatesh

Proceedings of the Handbook of Finite State Based Models and Applications., 2012

PredictingTrust from User Ratings.

[BibT_eX]

[DOI]

Nikolay Korovaiko

Proceedings of the 3rd International Conference on Ambient Systems, 2012

Computing optimal k-regret minimizing sets with top-k depth contours

[BibT_eX]

[DOI]

CoRR, 2012

Indexing Reverse Top-k Queries

[BibT_eX]

[DOI]

CoRR, 2012

Implication of regular expressions.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2012

Differential Privacy in Practice.

[BibT_eX]

[DOI]

Proceedings of the Secure Data Management - 9th VLDB Workshop, 2012

Learning the News in Social Networks.

[BibT_eX]

[DOI]

Krishnan Rajagopalan

Proceedings of the Foundations of Information and Knowledge Systems, 2012

SmarterDeals: a context-aware deal recommendation system based on the smartercontext engine.

[BibT_eX]

[DOI]

Proceedings of the Center for Advanced Studies on Collaborative Research, 2012

Large-Scale Mining of Co-occurrences: Challenges and Solutions.

[BibT_eX]

[DOI]

Ian Sandler

Proceedings of the 2012 Seventh International Conference on P2P, 2012

2011

Full-Text (Substring) Indexes in External Memory

[BibT_eX]

[DOI]

Marina Barsky

Synthesis Lectures on Data Management, Morgan & Claypool Publishers, ISBN: 978-3-031-01885-5, 2011

Rewriting of visibly pushdown languages for XML data integration.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Evolving schemas for streaming XML.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Suffix trees for inputs larger than main memory.

[BibT_eX]

[DOI]

Marina Barsky

Inf. Syst., 2011

On supporting dynamic web service selection with histogramming.

[BibT_eX]

[DOI]

Proceedings of the 5th IEEE International Workshop on the Maintenance and Evolution of Service-Oriented and Cloud-Based Systems, 2011

Indexing for Vector Projections.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2011

k-Anonymization of Social Networks by Vertex Addition.

[BibT_eX]

[DOI]

Proceedings of the ADBIS 2011, 2011

2010

A survey of practical algorithms for suffix tree construction in external memory.

[BibT_eX]

[DOI]

Marina Barsky

Softw. Pract. Exp., 2010

Certain answers and rewritings for local regular path queries on graph-structured data.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth International Database Engineering and Applications Symposium (IDEAS 2010), 2010

Online update of b-trees.

[BibT_eX]

[DOI]

Proceedings of the 19th ACM Conference on Information and Knowledge Management, 2010

2009

Fault-tolerant computation of distributed regular path queries.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Bounded regular path queries in view-based data integration.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

Harnessing the power of "favorites" lists for recommendation systems.

[BibT_eX]

[DOI]

Maryam Khezrzadeh

Proceedings of the 2009 ACM Conference on Recommender Systems, 2009

Preferential Infinitesimals for Information Retrieval.

[BibT_eX]

[DOI]

Maria Chowdhury

Proceedings of the Artificial Intelligence Applications and Innovations III, 2009

Scalable APRIORI-Based Frequent Pattern Discovery.

[BibT_eX]

[DOI]

Sean Chester

Ian Sandler

Proceedings of the 12th IEEE International Conference on Computational Science and Engineering, 2009

Trust-Based Infinitesimals for Enhanced Collaborative Filtering.

[BibT_eX]

[DOI]

Maria Chowdhury

Proceedings of the 15th International Conference on Management of Data, 2009

Suffix trees for very large genomic sequences.

[BibT_eX]

[DOI]

Proceedings of the 18th ACM Conference on Information and Knowledge Management, 2009

2008

A graph approach to the threshold all-against-all substring matching problem.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2008

Preferential Regular Path Queries.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2008

Scalable Ubiquitous Data Access in Clustered Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the Scientific and Statistical Database Management, 2008

Visibly Pushdown Transducers for Approximate Validation of Streaming XML.

[BibT_eX]

[DOI]

Ying Ying Ye

Proceedings of the Foundations of Information and Knowledge Systems, 2008

A new method for indexing genomes using on-disk suffix trees.

[BibT_eX]

[DOI]

Proceedings of the 17th ACM Conference on Information and Knowledge Management, 2008

2007

Distributed Multi-source Regular Path Queries.

[BibT_eX]

[DOI]

Proceedings of the Frontiers of High Performance Computing and Networking ISPA 2007 Workshops, 2007

Boundedness of Regular Path Queries in Data Integration Systems.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International Database Engineering and Applications Symposium (IDEAS 2007), 2007

Preferentially Annotated Regular Path Queries.

[BibT_eX]

[DOI]

Proceedings of the Database Theory, 2007

Towards practically feasible answering of regular path queries in lav data integration.

[BibT_eX]

[DOI]

Manuel Tamashiro

Proceedings of the Sixteenth ACM Conference on Information and Knowledge Management, 2007

Shortest Path Approaches for the Longest Common Subsequence of a Set of Strings.

[BibT_eX]

[DOI]

Proceedings of the 7th IEEE International Conference on Bioinformatics and Bioengineering, 2007

Grid-Aware Evaluation of Regular Path Queries on Spatial Networks.

[BibT_eX]

[DOI]

Zhuo Miao

Dan C. Stefanescu

Proceedings of the 21st International Conference on Advanced Information Networking and Applications (AINA 2007), 2007

2006

Regular path queries under approximate semantics.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2006

A New Algorithm for Fast All-Against-All Substring Matching.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2006

Enhanced Regular Path Queries on Semistructured Databases.

[BibT_eX]

[DOI]

Dan C. Stefanescu

Proceedings of the Current Trends in Database Technology - EDBT 2006, 2006

2005

Exchange, integration, and consistency of data: report on the ARISE/NISR workshop.

[BibT_eX]

[DOI]

SIGMOD Rec., 2005

Distributed evaluation of generalized path queries.

[BibT_eX]

[DOI]

Dan C. Stefanescu

Lida Thomo

Proceedings of the 2005 ACM Symposium on Applied Computing (SAC), 2005

2004

Query Answering and Containment for Regular Path Queries under Distortions.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Information and Knowledge Systems, 2004

2003

Algebraic rewritings for optimizing regular path queries.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Query containment and rewriting using views for regular path queries under constraints.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2003

New Rewritings and Optimizations for Regular Path Queries.

[BibT_eX]

[DOI]

Proceedings of the Database Theory, 2003

2001

Approximate Reasoning in Semistructured Data.

[BibT_eX]

[DOI]

Proceedings of the 8th International Workshop on Knowledge Representation meets Databases (KRDB 2001), 2001

2000

An Optimization Technique for Answering Regular Path Queries.

[BibT_eX]

[DOI]