ACM Home Page
Please provide us with feedback. Feedback
Evaluating very large datalog queries on social networks
Full text PdfPdf (365 KB)
Source Extending Database Technology; Vol. 360 archive
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology table of contents
Saint Petersburg, Russia
SESSION: Research sessions: Heterogeneous & distributed table of contents
Pages 577-587  
Year of Publication: 2009
ISBN:978-1-60558-422-5
Authors
Royi Ronen  Israel Institute of Technology
Oded Shmueli  Israel Institute of Technology
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 23,   Downloads (12 Months): 123,   Citation Count: 0
Additional Information:

abstract   references   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1516360.1516427
What is a DOI?

ABSTRACT

We consider a near future scenario in which users of a Web 2.0 application, such as a social network, contribute to the application not only data, but also rules which automatically query, utilize and create the data. For example, a user of a social network can define rules that automatically manage the user's friends list, the sending of various announcements, filtering of messages and more.

We examine the probable case of automated addition of connections by a participant. The connections to be added are defined using a query, associated to each participant. For this, we introduce and study the Query Network model, a graph-based model in which every node models a network participant and is associated with a Datalog rule. The union of all these individual user rules constitutes a very large, recursive, Datalog program whose size is of the order of magnitude of the size of the data being queried (data whose size in a social network can easily exceed 1TB). This greatly differs from the traditional assumption that queries are small and data are large. In particular, traditional optimizers will be hard pressed to handle such queries. This is the case even if queries are 'translated' to SQL (using views) and their union is transformed to a very large SQL query.

We have designed, built and experimented with evaluation algorithms for such query networks. Experiments with both synthetic and real datasets demonstrate the usefulness and high effectiveness of our methods. Extensions to the model are proposed, their implementation and testing are the subject of on-going work.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
R. Agrawal et. al. The Claremont Report on Database Research. Berkeley, California, 2008.
4
5
 
6
The Britannica Online Encyclopedia. http://www.britannica.com.
 
7
 
8
9
 
10
A. Chandra, P. Merlin, Optimal implementation of conjunctive queries in relational databases. 9th ACM Symposium on the Theory of Computing, 1997.
 
11
 
12
The DBLP Computer Science Bibliography, 2008. http://www.informatik.uni-trier.de/ley/db/
 
13
R. I. M. Dunbar: Neocortex size as a constraint on group size in primates. In Journal of Human Evolution 22, 1992.
 
14
R. I. M. Dunbar: Coevolution of neocortical size, group size and language in humans. In Behavioral and Brain Sciences 16(4), 1993.
 
15
Facebook Social Utility. http://www.facebook.com, 2008.
 
16
Facebook Query Language. http://developers.facebook.com, 2008.
17
 
18
E. M. Jin, M. Girvan, M. E. J. Newman: Structure of growing social networks. Physical Review E, Vol. 64, 2001.
 
19
 
20
LinkedIn, Professional Network Management. http://www.linkedin.com, 2008.
 
21
Metis - Family of Multilevel Partitioning Algorithms. Karypis Lab, University of Minnesota. http://glaros.dtc.umn.edu/gkhome/views/metis, 2008.
 
22
Modeling self-organization of communication and topology in social networks. http://cmol.nbi.dk/models/inforew/inforew.html
 
23
MySpace (a place for firends). http://www.myspace.com, 2008.
 
24
 
25
R. Ronen and O. Shmueli. Conjunctive Queries over DAGs. In NGITS 2006.
26
27
 
28
International Organization for Standardization (ISO). I.T. DB Language SQL Part 14: XML-Related Specifications (SQL/XML).
 
29
 
30
Wikipedia - The Free Encyclopedia. http://en.wikipedia.org/.
 
31
Wikipedia entry on Social Networks. http://en.wikipedia.org/wiki/Social_network.
 
32
XPath 1999. http://www.w3.org/TR/xpath.
 
33
XQuery 1.0. http://www.w3.org/TR/xquery.
Collaborative Colleagues:
Royi Ronen: colleagues
Oded Shmueli: colleagues