Querying Web Metadata:: Native score management and text support in databases

被引:0
|
作者
Özsoyoglu, G
Altingövde, IS
Al-Hamdani, A
Özel, SA
Ulusoy, Ö
Özsoyoglu, ZM
机构
[1] Case Western Reserve Univ, Cleveland, OH 44106 USA
[2] Bilkent Univ, TR-06533 Bilkent, Turkey
来源
ACM TRANSACTIONS ON DATABASE SYSTEMS | 2004年 / 29卷 / 04期
关键词
score management for Web applications; algorithms; languages; experimentation; design;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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 topic and metalinks. We extend database relations with scoring functions and importance scores. We add to SQL score-management clauses with well-defined semantic, and propose the sideway-value 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.
引用
收藏
页码:581 / 634
页数:54
相关论文
共 50 条
  • [1] Querying text databases for efficient information extraction
    Agichtein, E
    Gravano, L
    [J]. 19TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, PROCEEDINGS, 2003, : 113 - 124
  • [2] Astrobrowse: a web agent for querying astronomical databases
    Heikkila, CW
    McGlynn, TA
    White, NE
    [J]. ASTRONOMICAL DATA ANALYSIS SOFTWARE AND SYSTEMS VIII, 1999, 172 : 221 - 224
  • [3] Querying hyperset/Web-like databases
    Sazonov, Vladimir
    [J]. LOGIC JOURNAL OF THE IGPL, 2006, 14 (05) : 785 - 814
  • [4] Metadata management for scientific databases
    Pinoli, Pietro
    Ceri, Stefano
    Martinenghi, Davide
    Nanni, Luca
    [J]. INFORMATION SYSTEMS, 2019, 81 : 1 - 20
  • [5] WEBFINDIT: an architecture and system for querying web databases
    [J]. IEEE Internet Comput, 4 (30-41):
  • [6] WEBFINDIT: An architecture and system for querying web databases
    Bouguettaya, A
    Benatallah, B
    Ouzzani, M
    Hendra, L
    [J]. IEEE INTERNET COMPUTING, 1999, 3 (04) : 30 - +
  • [7] Optimised phrase querying and browsing of large text databases
    Bahle, D
    Williams, HE
    Zobel, J
    [J]. PROCEEDINGS OF THE 24TH AUSTRALASIAN COMPUTER SCIENCE CONFERENCE, ACSC 2001, 2001, 23 (01): : 11 - 19
  • [8] Querying dynamic and context-sensitive metadata in Semantic Web
    Nikitin, S
    Terziyan, V
    Tsaruk, Y
    Zharko, A
    [J]. AUTONOMOUS INTELLIGENT SYSTEMS: AGENTS AND DATA MINING, PROCEEDINGS, 2005, 3505 : 200 - 214
  • [9] Querying multiple databases dynamically on the world wide web
    Cardiff, J
    Catarci, T
    Passeri, M
    Santucci, G
    [J]. PROCEEDINGS OF THE FIRST INTERNATIONAL CONFERENCE ON WEB INFORMATION SYSTEMS ENGINEERING, VOL I, 2000, : 238 - 245
  • [10] Metadata management for clinical research databases
    Chong, QD
    Lee, YY
    Medhi, D
    Kerns, K
    Spertus, J
    Coffman, M
    [J]. AMIA 2002 SYMPOSIUM, PROCEEDINGS: BIOMEDICAL INFORMATICS: ONE DISCIPLINE, 2002, : 999 - 999