Keyword Searching and Browsing in Databases using BANKS

Keyword Searching and Browsing in Databases using BANKS Seoyoung Ahn Mar 3, 2005 The University of Texas at Arlington Keyword Searching and Browsing in Databases using BANKS

Outline o Introduction o Database and Query Model o Searching for the best answers o Browsing features of BANKS o Experiment o Conclusion Seoyoung Ahn Keyword Searching and Browsing in Databases using BANKS

Introduction o o Search engines on Web have popularized an unstructured querying and browsing n Simple and user-friendly n Users just type in keywords and follow hyperlink Relational databases are commonly searched using structured query language n o Users need to know the schema Keyword searching techniques cannot be used on data stored in databases n It often splits across the tables/tuples due to normalization Seoyoung Ahn Keyword Searching and Browsing in Databases using BANKS

Introduction(cond. . ) o BANKS (Browsing And Keyword Searching) n a system which enables keyword-based search on relational databases, together with data and schema browsing User Seoyoung Ahn HTTP BANKS system JDBC Database Keyword Searching and Browsing in Databases using BANKS

Introduction(cond. . ) o BANKS (Browsing And Keyword Searching) n n n a framework for keyword querying of relational database a novel and efficient heuristic algorithm for executing keyword queries key features of BANKS system Seoyoung Ahn Keyword Searching and Browsing in Databases using BANKS

Outline o Introduction o Database and Query Model n Informal Model n Formal Model n Query and Answer Model o Searching for the best answers o Browsing features of BANKS o Experiment o Conclusion Seoyoung Ahn Keyword Searching and Browsing in Databases using BANKS

Database and Query Model o Informal Model n Model Description database each tuple in db fk-pk-Link Seoyoung Ahn directed graph node in the graph directed edge Keyword Searching and Browsing in Databases using BANKS

Database and Query Model n The Schema Seoyoung Ahn Keyword Searching and Browsing in Databases using BANKS

Database and Query Model n A Fragment of the Database Seoyoung Ahn Keyword Searching and Browsing in Databases using BANKS

Database and Query Model o Informal Model(cond. ) n n n An answer to a query should be a subgraph connecting nodes matching the keywords. The importance of a link depends upon the type of the link i. e. what relations it connects and on its semantics Ignoring directionality would cause problems because of “hubs” which are connected to a large numbers of nodes. Seoyoung Ahn Keyword Searching and Browsing in Databases using BANKS

Database and Query Model o Formal Database Model Nodes and edges n Node Weight : N(u) Depends on the prestige Set the node prestige = the indegree of the node Nodes that have multiple pointers to them get a higher prestige Node score N = root node weight + ∑ leaf node weight Seoyoung Ahn Keyword Searching and Browsing in Databases using BANKS

Database and Query Model o Formal Database Model (Cond. ) n Edge Weights Some pupluar tuples can be connected many other tuples Edge with forward and backward edge weights Weight of a forward link = the strength of the proximity relationship between two tuples (set to 1 by default) Weight of a backward link = indegree of edges pointing to the node Total edge weight = ∑ edge weights Edge score E = 1 / Total edge weight Seoyoung Ahn Keyword Searching and Browsing in Databases using BANKS

Database and Query Model o Formal Database Model (Cond. ) n Overall relevance score = Node weights + Edge Weight Normalize in the range [0, 1] n Combine using weighting factor Additive: (1 - ) E + N; multiplicative: E * N Seoyoung Ahn Keyword Searching and Browsing in Databases using BANKS

Database and Query Model Query and Answer Model o n Query A set of keywords e. g. {k 1, k 2, …kn} A set of nodes Si = {S 1, S 2, …Sn} Locate nodes matching search terms t 1, t 2, …tn n Answer Model A rooted directed tree connecting keyword nodes n Relevance score of an answer tree Relevance scores of it nodes and its edge weight Seoyoung Ahn Keyword Searching and Browsing in Databases using BANKS

Database and Query Model o Answer Model n n A rooted directed tree connecting keyword nodes Multiple answers Ranked by proximity + prestige Proximity edges weights Prestige indegree of nodes n Relevance score of an answer tree Relevance scores of it nodes and its edge weight Seoyoung Ahn Keyword Searching and Browsing in Databases using BANKS

Database and Query Model n Result of query “sudarshan soumen” Seoyoung Ahn Keyword Searching and Browsing in Databases using BANKS

Outline o Introduction o Database and Query Model o Searching for the best answers n Backward expanding search algorithm o Browsing features of BANKS o Experiment o Conclusion Seoyoung Ahn Keyword Searching and Browsing in Databases using BANKS

Searching for the best answers o Backward expanding search algorithm n n n Offers a heuristic solution for incrementally computing query results. Assume that the graph fits in memory Start at leaf nodes each containing a query keyword Run concurrent single source shortest path algorithm from each such node Traverses the graph edges backwards Confluence of backward paths identify answer tree roots Output a node whenever it is on the intersection of the sets of nodes reached from each keyword n Answer trees may not be generated in relevance order Insert answers to a small buffer (heap) Output highest ranked answer from buffer to user when buffer is full Seoyoung Ahn Keyword Searching and Browsing in Databases using BANKS

Searching for the best answers n Model (Query : Charuta Sudarshan Roy ) BANKS: Keyword search… paper writes Charuta Seoyoung Ahn S. Sudarshan Prasan Roy author Keyword Searching and Browsing in Databases using BANKS

Outline o Introduction o Database and Query Model o Searching for the best answers o Browsing features of BANKS o Experiment o Conclusion Seoyoung Ahn Keyword Searching and Browsing in Databases using BANKS

Browsing o BANKS system provides n n A rich interface to browse data stored in a relational database Automatically generates browsable views of database relations and query results n Schema browsing and data browsing n A hyperlink to the referenced tuple n Templates for several predefined ways of displaying data Seoyoung Ahn Keyword Searching and Browsing in Databases using BANKS

Browsing n Data browsing Seoyoung Ahn Keyword Searching and Browsing in Databases using BANKS

Browsing n Schema browsing Seoyoung Ahn Keyword Searching and Browsing in Databases using BANKS

Outline o Introduction o Database and Query Model o Searching for the best answers o Browsing features of BANKS o Experiment o Conclusion Seoyoung Ahn Keyword Searching and Browsing in Databases using BANKS

Error scores vs parameter choices o The rankings are relatively stable across different choices of parameter values o = 0. 2 coupled with log scaling of edges weights does best Seoyoung Ahn Keyword Searching and Browsing in Databases using BANKS

Outline o Introduction o Database and Query Model o Searching for the best answers o Browsing features of BANKS o Experiment o Conclusion Seoyoung Ahn Keyword Searching and Browsing in Databases using BANKS

Conclusion o BANKS system n n provides an integrated browsing and keyword querying system for relational databases allows users with no knowledge of database systems or schema to query and browse relational database with ease Seoyoung Ahn Keyword Searching and Browsing in Databases using BANKS