Article

Ρ-Queries: enabling querying for semantic associations on the semantic web

Authors:

Kemafor Anyanwu,

Amit ShethAuthors Info & Claims

WWW '03: Proceedings of the 12th international conference on World Wide Web

Pages 690 - 699

https://doi.org/10.1145/775152.775249

Published: 20 May 2003 Publication History

Abstract

This paper presents the notion of Semantic Associations as complex relationships between resource entities. These relationships capture both a connectivity of entities as well as similarity of entities based on a specific notion of similarity called r-isomorphism. It formalizes these notions for the RDF data model, by introducing a notion of a Property Sequence as a type. In the context of a graph model such as that for RDF, Semantic Associations amount to specific certain graph signatures. Specifically, they refer to sequences (i.e. directed paths) here called Property Sequences, between entities, networks of Property Sequences (i.e. undirected paths), or subgraphs of r-isomorphic Property Sequences.The ability to query about the existence of such relationships is fundamental to tasks in analytical domains such as national security and business intelligence, where tasks often focus on finding complex yet meaningful and obscured relationships between entities. However, support for such queries is lacking in contemporary query systems, including those for RDF.

References

[1]

S. Abiteboul, P. Buneman, and D. Suciu. Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann, 1999.

Digital Library

[2]

S. Abiteboul. Querying Semi-Structured data. In Proc. of ICDT, Jan 1997. http://citeseer.nj.nec.com/abiteboul97querying.html

Digital Library

[3]

S. Abiteboul, D. Quass, J. McHugh, J. Widom, and J. Wiener. The Lorel Query Language for Semistructured Data. International Journal on Digital Libraries, 1(1):68--88, April 1997.

[4]

S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.

Digital Library

[5]

Agrawal. Alpha: An Extension of Relational Algebra to Expressa Class of Recursive Queries. IEEE Transactions on Software Engineering. 14(7):879-- 885, July 1988.

Digital Library

[6]

R. Agrawal, A. Borgida, and H.V. Jagadish. Efficient Management of Transitive Relationships in Large Data Bases. In SIGMOD'89, pages 253--262, Portland, Oregon, USA, 1989.

Digital Library

[7]

R. Agrawal, T, Imielienski and A. Swami. Mining Assocation Rules between Sets of Items in Large Databases. Proc. Conf. On Management of Data. Washington, DC, USA, 207--216. ACM Press, New York, NY USA 1993.

Digital Library

[8]

S. Alexaki, G. Karvounarakis, V. Christophides, D. Plexousakis, and K. Tolle. The ICS-FORTH RDFSuite: Managing Voluminous RDF Description Bases. In 2nd International Workshop on the Semantic Web, pages 1--13, Hong Kong, 2001.

[9]

S. Alexaki, G. Karvounarakis, V. Christophides, D. Plexousakis, and K. Tolle. On Storing Voluminous RDF descriptions: The case of Web Portal Catalogs. In 4th International Workshop on the Web and Databases (WebDB), Santa Barbara, CA, 2001. Available at http://139.91.183.30:9090/RDF/publications/webdb2001.pdf.

[10]

K. Anyanwu, A. Sheth, The r Operator: Discovering and Ranking Associations on the Semantic Web. SIGMOD Record ( Special issue on Amicalola Workshop http://lsdis.cs.uga.edu/SemNSF/SIGMOD-Record-Dec02.htm), December 2002.

Digital Library

[11]

D. Avant, M. Baum, C. Bertram, M. Fisher, A. Sheth, Y. Warke, "Semantic Technology Applications for Homeland Security," Proc. Of the 11th Intl Conf on Information and Knowledge Management (CIKM 2002), McLean VA, November 4--9, 2002, pp. 611--613.

Digital Library

[12]

L. Babel, I. Ponomarenko, G. Tinhofer. The Isomorphism Problem for Directed Paths and For Rooted Directed Path Graphs. Journal of Algorithms, 21:542--564, 1996.

Digital Library

[13]

T. Berners-Lee, J. Hendler, and O. Lassila. The Semantic Web. Scientific American, May 2001.

[14]

B. Berendt, A. Hotho, G. Stumme. Towards Semantic Web Mining. In Proceedings of the International Semantic Web Conference, pp. 264--278, Sardinia, Italy. June 2002.

Digital Library

[15]

A. Branstadt, V. B. Le, J. P. Spinrad. Graph Classes: A Survey. SIAM 1999.

Digital Library

[16]

T. Bray, J. Paoli, and C.M. Sperberg-McQueen. Extensible Markup Language (XML) 1.0. W3C Recommendation http://www.w3.org/TR/REC-xml/, February 1998.

[17]

D. Brickley and R.V. Guha. Resource Description Framework (RDF) Schema Specification 1.0, W3C Candidate Recommendation. 2000.

[18]

J. Broekstra, A. Kampman, and F. van Harmelen. SESAME: An Architecture for Storing and Querying RDF Data and Schema Information. In D. Fensel, J. Hendler, H. Lieberman, and W. Wahlster, editors, Semantics for the WWW. MIT Press, 2001. http://citeseer.nj.nec.com/broekstra01sesame.html.

Digital Library

[19]

P. Buneman, M. Fernandez, D. Suciu. UnQL: A Query Language and Algebra for Semistructured Data Based on Structural Recursion. VLDB Journal, 9(1):76--110, 2000.

Digital Library

[20]

W. W. Chang mailto:[email protected], A Discussion of the Relationship Between RDF-Schema and UML http://www.w3.org/TR/NOTE-rdf-uml/. A W3C Note, NOTE-rdf-uml-19980804.

[21]

M. Chen, J.Han and P. Yu. Data Mining: An Overview from the Database Perspective. IEEE Trans. On Knowledge and Data Engineering. Vol. 8. No. 6. December 1996.

Digital Library

[22]

V. Christophides, S. Abiteboul, S. Cluet, and M. Scholl. From Structured Documents to Novel Query Facilities. In Proc. of ACM SIGMOD Conf. on Management of Data, pp. 313--324, Minneapolis, Minnesota, May 1994.

Digital Library

[23]

V. Christophides, S. Cluet, and G. Moerkotte. Evaluating Queries with Generalized Path Expressions. In Proc. of ACM SIGMOD, pp.413--422, 1996.

Digital Library

[24]

D. Chamberlin, D. Florescu, J. Robie, J. Simeon, and M. Stefanescu. XQuery: A Query Language for XML. Working draft, World Wide Web Consortium, June 2001. http://www.w3.org/TR/xquery/.

[25]

M. Dean, D. Connolly, F. Harmelen, J.Hendler, I. Horrocks, D. McGuinness, P. F. Patel-Schneider, and L.Stein. OWL Web Ontology Language 1.0 Reference http://www.w3.org/TR/2002/WD-owl-ref-20020729/, W3C Working Draft 29 July 2002. Latest version is available at http://www.w3.org/TR/owl-ref/.

[26]

U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth and R Uthurusany. Advances in Knowledge Discovery and Data Mining. AAAI/MIT Press 1996.

Digital Library

[27]

R. Fikes. DAML+OIL query language proposal, August 2001. http://www.daml.org/listarchive/joint-committee/0572.html.

[28]

R. H. Guting. GraphDB: Modeling and querying graphs in databases. In Proceedings of the International Conference on Very Large Data Bases, pp. 297--308, 1994.

Digital Library

[29]

B. Hammond, A. Sheth, and K. Kochut, Semantic Enhancement Engine: A Modular Document Enhancement Platform for Semantic Applications over Heterogeneous Content, in Real World Semantic Web Applications, V. Kashyap and L. Shklar, Eds., IOS Press, December2002, pp. 29--49.

[30]

S. Handschuh and S. Staab. Authoring and annotation of web pages in CREAM. In The Eleventh International World Wide Web Conference (WWW2002), Honolulu, Hawaii, USA 7--11 May, 2002.

Digital Library

[31]

F. Harmelen, P. F. Patel-Schneider, I. Horrocks eds. Reference Description of the DAML+OIL (March 2001) ontology markup language.

[32]

M. Hearst. Distinguishing between Web Data Mining and Information Access http://www.sims.berkeley.edu/~hearst/talks/data-mining-panel/sld001.htm. Position statement for Web Data Mining KDD 97.

[33]

Y. E. Ioannidis, R. Ramakrishnan http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/r/Ramakrishnan:Raghu.html, L.Winger http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/w/Winger:Linda.html: Transitive Closure Algorithms Based on Graph Traversal. TODS 18 http://www.informatik.uni-trier.de/~ley/db/journals/tods/tods18.html (3): 512--576 (1993).

Digital Library

[34]

Y. E. Ioannidis, Y. Lashkari, Incomplete Path Expressions and their Disambiguation, In Proc. of the 1994 ACM SIGMOD, International Conference on Management of Data. p.138--149, May 24--27, 1994, Minneapolis, Minnesota, United States.

Digital Library

[35]

P. Hayes. RDF Model Theory. W3C Working Draft, September 2001.

[36]

I. Horrocks, S. Tessaris. The Semantics of DQL. http://www.cs.man.ac.uk/~horrocks/Private/DAML/DQL-semantics.pdf.

[37]

I. Horrocks and S. Tessaris. A Conjunctive Query Language for Description Logic Aboxes. In Proc. of AAAI-00, 2000.

Digital Library

[38]

V. Hristidis and Y. Papakonstanti-nou. DISCOVER : Keyword search in relational databases . In Procs. VLDB, Aug. 2002.

Digital Library

[39]

ICS-FORTH. The ICS-FORTH RDFSuite web site. Available at http://139.91.183.30:9090/RDF, March 2002.

[40]

G. Karvounarakis, S. Alexaki, V. Christophides, D. Plexousakis, M. Scholl, RQL: A Declarative Query Language for RDF, WWW2002, May 7--11, 2002, Honolulu, Hawaii, USA.

Digital Library

[41]

M. S. Lacher and S.Decker. On the Integration of Topic Maps and RDF Data. In Proc. of Semantic Web Working Symposium. Palo Alto. California. August 2001.

[42]

O. Lassila and R. Swick. Resource Description Framework (RDF) Model and Syntax Specification, W3C Recommendation. 1999.

[43]

M. Mannino, L. Shapiro http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/s/Shapiro:Leonard_D=.html, L. Extensions to Query Languages for Graph Traversal Problems. TKDE 2 http://www.informatik.uni-trier.de/~ley/db/journals/tkde/tkde2.html (3): 353--363,1990.

Digital Library

[44]

A. O. Mendelzon and P. T. Wood. Finding Regular Simple Paths in Graph Databases. SIAM J. Comput., 24(6):1235--1258, 1995.

Digital Library

[45]

L. Miller., A. Seaborne, A. Reggiori. Three Implementations of SquishQL, a Simple RDF Query Language. In Proc. of 1st International Semantic Web Conference. ISWC2002. June9--12, 2002, Sardinia, Italy.

Digital Library

[46]

Nanopoulos A. and Manolopoulos Y.: "Mining Patterns from Graph Traversals http://delab.csd.auth.gr/papers/DKE01nm.pdf", Data and Knowledge Engineering, Vol.37, No.3, pp.243--266, 2001.

Digital Library

[47]

J. Rumbaugh, I. Jacobson, and G. Booch. The Unified Modeling Language Reference Manual. Addison-Wesley, 1999.

Digital Library

[48]

A. Seaborne. RDQL: A Data Oriented Query Language for RDF Models. 2001. http://www.hpl.hp.com/semweb/rdql-grammar.html.

[49]

A. Sheth, C. Bertram, D. Avant, B. Hammond, K. Kochut, Y. Warke, Semantic Content Management for Enterprises and the Web, IEEE Internet Computing, July/August 2002, pp. 80--87.

Digital Library

[50]

A. Sheth, S. Thacker and S. Patel. Complex Relationship and Knowledge Discovery Support in the InfoQuilt System. VLDB Journal. September 25, 2002.

Digital Library

[51]

M. Sintek and S. Decker. TRIPLE---A Query, Inference, and Transformation Language for the Semantic Web. International Semantic Web Conference (ISWC) file:///E:/WINDOWS/Desktop/return, Sardinia, June 2002. (http://www.dfki.uni-kl.de/frodo/triple/).

Digital Library

[52]

Tarjan, R. Fast Algorithms for Solving Path Problems. J. ACM Vol. 28, No. 3, July 1891, pp.594--614.

Digital Library

[53]

DQL: DAML Query Language. http://www.daml.org/2002/08/dql/.

[54]

Inkling: RDF query using SquishQL, 2001. http://swordfish.rdfweb.org/rdfquery/.

[55]

ISO/IEC 13250: 2000 Topic Maps, Jan 2000 http://www.topicmaps.org/.

[56]

JENA - A Java API for RDF. http://www-uk.hpl.hp.com/people/bwm/rdf/jena/index.htm.

[57]

Whitepaper on National Security and Intelligence, Semagix Inc. 2002. http://www.semagix.com/pdf/national_security.pdf.

Cited By

Song JWen DXu LQin LZhang WLin X(2024)On Querying Historical Connectivity in Temporal GraphsProceedings of the ACM on Management of Data10.1145/36549602:3(1-25)Online publication date: 30-May-2024
https://doi.org/10.1145/3654960
Akram HPervez Mir RFarooq M(2022)A Treatise to Metrics and Frameworks for Semantic Social Networks: A Systematic Literature ReviewVFAST Transactions on Software Engineering10.21015/vtse.v10i3.95410:3(90-100)Online publication date: 30-Sep-2022
https://doi.org/10.21015/vtse.v10i3.954
Zhu HZhou YLi QShao Z(2022)Personality modeling from image aesthetic attribute-aware graph representation learningJournal of Visual Communication and Image Representation10.1016/j.jvcir.2022.10367589:COnline publication date: 1-Nov-2022
https://dl.acm.org/doi/10.1016/j.jvcir.2022.103675
Show More Cited By

Index Terms

Ρ-Queries: enabling querying for semantic associations on the semantic web
1. Information systems
  1. Data management systems
    1. Query languages

Recommendations

The ρ operator: discovering and ranking associations on the semantic web

In this paper, we introduce an approach that supports querying for Semantic Associations on the Semantic Web. Semantic Associations capture complex relationships between entities involving sequences of predicates, and sets of predicate sequences that ...
Finding relevant semantic association paths using semantic ant colony optimization algorithm

Semantic Associations are complex relationships between entities in a knowledge base represented in a graph. While searching Semantic Association between entities in an RDF graph, there may be too many paths connecting them. Each path has different ...
Semantic analytics on social networks: experiences in addressing the problem of conflict of interest detection
WWW '06: Proceedings of the 15th international conference on World Wide Web

In this paper, we describe a Semantic Web application that detects Conflict of Interest (COI) relationships among potential reviewers and authors of scientific papers. This application discovers various 'semantic associations' between the reviewers and ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

WWW '03: Proceedings of the 12th international conference on World Wide Web

May 2003

772 pages

ISBN:1581136803

DOI:10.1145/775152

Conference Chairs:
Gusztáv Hencsey
MTA SZTAKI, Hungary
,
Bebo White
Stanford Linear Accelerator Center, USA
,
Program Chairs:
Yih-Farn Robin Chen
AT&T Labs -- Research, USA
,
László Kovács
MTA SZTAKI, Hungary
,
Steve Lawrence
Google Inc., USA

Copyright © 2003 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

ACM: Association for Computing Machinery

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 20 May 2003

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 1,899 of 8,196 submissions, 23%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

130
Total Citations
View Citations
1,774
Total Downloads

Downloads (Last 12 months)22
Downloads (Last 6 weeks)2

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Song JWen DXu LQin LZhang WLin X(2024)On Querying Historical Connectivity in Temporal GraphsProceedings of the ACM on Management of Data10.1145/36549602:3(1-25)Online publication date: 30-May-2024
https://doi.org/10.1145/3654960
Akram HPervez Mir RFarooq M(2022)A Treatise to Metrics and Frameworks for Semantic Social Networks: A Systematic Literature ReviewVFAST Transactions on Software Engineering10.21015/vtse.v10i3.95410:3(90-100)Online publication date: 30-Sep-2022
https://doi.org/10.21015/vtse.v10i3.954
Zhu HZhou YLi QShao Z(2022)Personality modeling from image aesthetic attribute-aware graph representation learningJournal of Visual Communication and Image Representation10.1016/j.jvcir.2022.10367589:COnline publication date: 1-Nov-2022
https://dl.acm.org/doi/10.1016/j.jvcir.2022.103675
Aydın Y(2022)A new Copy-Move forgery detection method using LIOPJournal of Visual Communication and Image Representation10.1016/j.jvcir.2022.10366189:COnline publication date: 1-Nov-2022
https://dl.acm.org/doi/10.1016/j.jvcir.2022.103661
Wang XChen WNiu PYang H(2022)Image copy-move forgery detection based on dynamic threshold with dense pointsJournal of Visual Communication and Image Representation10.1016/j.jvcir.2022.10365889:COnline publication date: 1-Nov-2022
https://dl.acm.org/doi/10.1016/j.jvcir.2022.103658
Chen JWu HLu LLuo XHu J(2022)Single underwater image haze removal with a learning-based approach to blurriness estimationJournal of Visual Communication and Image Representation10.1016/j.jvcir.2022.10365689:COnline publication date: 1-Nov-2022
https://dl.acm.org/doi/10.1016/j.jvcir.2022.103656
Liu JTan JGe XHu DHe L(2022)Blind deblurring with fractional-order calculus and local minimal pixel priorJournal of Visual Communication and Image Representation10.1016/j.jvcir.2022.10364589:COnline publication date: 1-Nov-2022
https://dl.acm.org/doi/10.1016/j.jvcir.2022.103645
Yang YWang ABu DFeng ZLiang J(2022)AS-NetJournal of Visual Communication and Image Representation10.1016/j.jvcir.2022.10363989:COnline publication date: 1-Nov-2022
https://dl.acm.org/doi/10.1016/j.jvcir.2022.103639
Shamsuddin ARagunathan KP. ARaja Sekar P.M. DSankaran P(2022)From synthetic to natural — single natural image dehazing deep networks using synthetic dataset domain randomizationJournal of Visual Communication and Image Representation10.1016/j.jvcir.2022.10363689:COnline publication date: 1-Nov-2022
https://dl.acm.org/doi/10.1016/j.jvcir.2022.103636
Peng ZDong YLuo MWu XZheng Q(2022)A new self-supervised task on graphsInformation Sciences: an International Journal10.1016/j.ins.2022.06.046607:C(1195-1210)Online publication date: 1-Aug-2022
https://dl.acm.org/doi/10.1016/j.ins.2022.06.046
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents