Querying web metadata

Native score management and text support in databases

Gültekin Özsoyoǧlu, Ismail Sengör Altingövde, Abdullah Al-Hamdani, Selma Ayşe Özel, Özgür Ulusoy, Zehra Meral Özsoyoǧlu

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

In this article, we discuss the issues involved in adding a native score management system to object-relational databases, to be used in querying Web metadata (that describes the semantic content of Web resources). The Web metadata model is based on topics (representing entities), relationships among topics (called metalinks), and importance scores (sideway values) of topics and metalinks. We extend database relations with scoring functions and importance scores. We add to SQL score-management clauses with well-defined semantics, and propose the sidewayvalue algebra (SVA), to evaluate the extended SQL queries. SQL extensions and the SVA algebra are illustrated through two Web resources, namely, the DBLP Bibliography and the SIGMOD Anthology. SQL extensions include clauses for propagating input tuple importance scores to output tuples during query processing, clauses that specify query stopping conditions, threshold predicates (a type of approximate similarity predicates for text comparisons), and user-defined-function-based predicates. The propagated importance scores are then used to rank and return a small number of output tuples. The query stopping conditions are propagated to SVA operators during query processing. We show that our SQL extensions are well-defined, meaning that, given a database and a query Q, under any query processing scheme, the output tuples of Q and their importance scores stay the same. To process the SQL extensions, we discuss two sideway value algebra operators, namely, sideway value algebra join and topic closure, give their implementation algorithms, and report their experimental evaluations.

Original languageEnglish
Pages (from-to)581-634
Number of pages54
JournalACM Transactions on Database Systems
Volume29
Issue number4
DOIs
Publication statusPublished - Dec 2004

Fingerprint

Metadata
Algebra
Query processing
Mathematical operators
Semantics
Bibliographies

Keywords

  • Score management for Web applications

ASJC Scopus subject areas

  • Information Systems

Cite this

Özsoyoǧlu, G., Altingövde, I. S., Al-Hamdani, A., Özel, S. A., Ulusoy, Ö., & Özsoyoǧlu, Z. M. (2004). Querying web metadata: Native score management and text support in databases. ACM Transactions on Database Systems, 29(4), 581-634. https://doi.org/10.1145/1042046.1042047

Querying web metadata : Native score management and text support in databases. / Özsoyoǧlu, Gültekin; Altingövde, Ismail Sengör; Al-Hamdani, Abdullah; Özel, Selma Ayşe; Ulusoy, Özgür; Özsoyoǧlu, Zehra Meral.

In: ACM Transactions on Database Systems, Vol. 29, No. 4, 12.2004, p. 581-634.

Research output: Contribution to journalArticle

Özsoyoǧlu, G, Altingövde, IS, Al-Hamdani, A, Özel, SA, Ulusoy, Ö & Özsoyoǧlu, ZM 2004, 'Querying web metadata: Native score management and text support in databases', ACM Transactions on Database Systems, vol. 29, no. 4, pp. 581-634. https://doi.org/10.1145/1042046.1042047
Özsoyoǧlu, Gültekin ; Altingövde, Ismail Sengör ; Al-Hamdani, Abdullah ; Özel, Selma Ayşe ; Ulusoy, Özgür ; Özsoyoǧlu, Zehra Meral. / Querying web metadata : Native score management and text support in databases. In: ACM Transactions on Database Systems. 2004 ; Vol. 29, No. 4. pp. 581-634.
@article{3abc8fec718d4e32aec1ecc68aa74218,
title = "Querying web metadata: Native score management and text support in databases",
abstract = "In this article, we discuss the issues involved in adding a native score management system to object-relational databases, to be used in querying Web metadata (that describes the semantic content of Web resources). The Web metadata model is based on topics (representing entities), relationships among topics (called metalinks), and importance scores (sideway values) of topics and metalinks. We extend database relations with scoring functions and importance scores. We add to SQL score-management clauses with well-defined semantics, and propose the sidewayvalue algebra (SVA), to evaluate the extended SQL queries. SQL extensions and the SVA algebra are illustrated through two Web resources, namely, the DBLP Bibliography and the SIGMOD Anthology. SQL extensions include clauses for propagating input tuple importance scores to output tuples during query processing, clauses that specify query stopping conditions, threshold predicates (a type of approximate similarity predicates for text comparisons), and user-defined-function-based predicates. The propagated importance scores are then used to rank and return a small number of output tuples. The query stopping conditions are propagated to SVA operators during query processing. We show that our SQL extensions are well-defined, meaning that, given a database and a query Q, under any query processing scheme, the output tuples of Q and their importance scores stay the same. To process the SQL extensions, we discuss two sideway value algebra operators, namely, sideway value algebra join and topic closure, give their implementation algorithms, and report their experimental evaluations.",
keywords = "Score management for Web applications",
author = "G{\"u}ltekin {\"O}zsoyoǧlu and Alting{\"o}vde, {Ismail Seng{\"o}r} and Abdullah Al-Hamdani and {\"O}zel, {Selma Ayşe} and {\"O}zg{\"u}r Ulusoy and {\"O}zsoyoǧlu, {Zehra Meral}",
year = "2004",
month = "12",
doi = "10.1145/1042046.1042047",
language = "English",
volume = "29",
pages = "581--634",
journal = "ACM Transactions on Database Systems",
issn = "0362-5915",
publisher = "Association for Computing Machinery (ACM)",
number = "4",

}

TY - JOUR

T1 - Querying web metadata

T2 - Native score management and text support in databases

AU - Özsoyoǧlu, Gültekin

AU - Altingövde, Ismail Sengör

AU - Al-Hamdani, Abdullah

AU - Özel, Selma Ayşe

AU - Ulusoy, Özgür

AU - Özsoyoǧlu, Zehra Meral

PY - 2004/12

Y1 - 2004/12

N2 - In this article, we discuss the issues involved in adding a native score management system to object-relational databases, to be used in querying Web metadata (that describes the semantic content of Web resources). The Web metadata model is based on topics (representing entities), relationships among topics (called metalinks), and importance scores (sideway values) of topics and metalinks. We extend database relations with scoring functions and importance scores. We add to SQL score-management clauses with well-defined semantics, and propose the sidewayvalue algebra (SVA), to evaluate the extended SQL queries. SQL extensions and the SVA algebra are illustrated through two Web resources, namely, the DBLP Bibliography and the SIGMOD Anthology. SQL extensions include clauses for propagating input tuple importance scores to output tuples during query processing, clauses that specify query stopping conditions, threshold predicates (a type of approximate similarity predicates for text comparisons), and user-defined-function-based predicates. The propagated importance scores are then used to rank and return a small number of output tuples. The query stopping conditions are propagated to SVA operators during query processing. We show that our SQL extensions are well-defined, meaning that, given a database and a query Q, under any query processing scheme, the output tuples of Q and their importance scores stay the same. To process the SQL extensions, we discuss two sideway value algebra operators, namely, sideway value algebra join and topic closure, give their implementation algorithms, and report their experimental evaluations.

AB - In this article, we discuss the issues involved in adding a native score management system to object-relational databases, to be used in querying Web metadata (that describes the semantic content of Web resources). The Web metadata model is based on topics (representing entities), relationships among topics (called metalinks), and importance scores (sideway values) of topics and metalinks. We extend database relations with scoring functions and importance scores. We add to SQL score-management clauses with well-defined semantics, and propose the sidewayvalue algebra (SVA), to evaluate the extended SQL queries. SQL extensions and the SVA algebra are illustrated through two Web resources, namely, the DBLP Bibliography and the SIGMOD Anthology. SQL extensions include clauses for propagating input tuple importance scores to output tuples during query processing, clauses that specify query stopping conditions, threshold predicates (a type of approximate similarity predicates for text comparisons), and user-defined-function-based predicates. The propagated importance scores are then used to rank and return a small number of output tuples. The query stopping conditions are propagated to SVA operators during query processing. We show that our SQL extensions are well-defined, meaning that, given a database and a query Q, under any query processing scheme, the output tuples of Q and their importance scores stay the same. To process the SQL extensions, we discuss two sideway value algebra operators, namely, sideway value algebra join and topic closure, give their implementation algorithms, and report their experimental evaluations.

KW - Score management for Web applications

UR - http://www.scopus.com/inward/record.url?scp=11344289038&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=11344289038&partnerID=8YFLogxK

U2 - 10.1145/1042046.1042047

DO - 10.1145/1042046.1042047

M3 - Article

VL - 29

SP - 581

EP - 634

JO - ACM Transactions on Database Systems

JF - ACM Transactions on Database Systems

SN - 0362-5915

IS - 4

ER -