Modeling QueryBased Access to Text Databases基于查询的文本数据库建模.pptVIP

Modeling Query-Based Access to Text Databases Eugene AgichteinPanagiotis IpeirotisLuis Gravano Computer Science Department Columbia University Scalable Text “Mining” Often only a tiny fraction of a text database is relevant, so processing every document is unnecessarily expensive. Often relevant information is not crawlable, but available only via a search engine. Task1: Extracting Structured Information “Buried” in Text Documents Information Extraction Applications Over a corporation’s customer report or email complaint database: enabling sophisticated querying and analysis Over biomedical literature: identifying drug/condition interactions Over newspaper archives: tracking disease outbreaks, terrorist attacks; intelligence Goal: Extract All Tuples of a Relation from a Document Database One approach: feed every document to information extraction system Problem: efficiency, accessibility! A Query-Based Strategy for Information Extraction 0 While seed has unprocessed tuple t 1 Retrieve up to MaxResults documents matching t 2 Extract new tuples te from  these documents 3 Augment seed with te “Hidden Web” Databases Search Over the “Hidden Web” A Query-Based Strategy for Constructing Database Summaries 0 While seed has unprocessed word t 1 Retrieve up to MaxResults documents matching t 2 Extract new words te from  these documents 3 Augment seed with te Query-Based Information Extraction and Database Summary Construction Model: Querying Graph Tokens T: Task 1: tuple attributes “microsoft” AND “redmond” “acm” AND “new york” Task 2: words “sigmod”, “webdb” Tokens (as queries) retrieve documents in D Documents contain tokens Model: Reachability Graph Model (cont.): Connectivity Power-law Graphs Conjecture: Degree distribution in the reachability graph is described by a power-law: Completely described by only two parameters, a and b. Power-law random graphs are expected to have at most one giant connected comp