Web Data Management,9780387001753

Web Data Management

by ; ;
ISBN13: 9780387001753
ISBN10: 0387001751
Format: Hardcover
Pub. Date: 2003-10-01
Publisher(s): Springer-Verlag New York Inc
List Price: $94.49

Rent Textbook

Select for Price
Add to Cart
There was a problem. Please try again later.

Rent Digital

Rent Digital Options
Online:30 Days access
Downloadable:30 Days
$32.04
Online:60 Days access
Downloadable:60 Days
$42.72
Online:90 Days access
Downloadable:90 Days
$53.40
Online:120 Days access
Downloadable:120 Days
$64.08
Online:180 Days access
Downloadable:180 Days
$69.42
Online:1825 Days access
Downloadable:Lifetime Access
$106.80
*To support the delivery of the digital material to you, a digital delivery fee of $3.99 will be charged on each digital item.
$69.42*
Add to Cart

New Textbook

We're Sorry
Sold Out

Used Textbook

We're Sorry
Sold Out

Buy from our Marketplace starting at $22.00

How Marketplace Works:

  • This item is offered by an independent seller and not shipped from our warehouse
  • Item details like edition and cover design may differ from our description; see seller's comments before ordering.
  • Sellers much confirm and ship within two business days; otherwise, the order will be cancelled and refunded.
  • Marketplace purchases cannot be returned to eCampus.com. Contact the seller directly for inquiries; if no response within two days, contact customer service.
  • Additional shipping costs apply to Marketplace purchases. Review shipping costs at checkout.

Summary

Existence of huge amounts of data on the Web has developed an undeferring need to locate right information at right time, as well as to integrating information effectively to provide a comprehensive source of relevant information. There is a need to develop efficient tools for analyzing and managing Web data, and efficiently managing Web information from the database perspective. The book proposes a data model called WHOM (Warehouse Object Model) to represent HTML and XML documents in the warehouse. It defines a set of web algebraic operators for building new web tables by extracting relevant data from the Web, as well as generating new tables from existing ones. These algebraic operators are used for change detection.

Table of Contents

Preface vii
Introduction
1(16)
Motivation
2(9)
Problems with Web Data
2(3)
Limitations of Search Engines
5(2)
Limitations of Traditional Data Warehouse
7(3)
Warehousing the Web
10(1)
Architecture and Functionalities
11(3)
Scope of This Book
13(1)
Research Issues
14(1)
Contributions of the Book
15(2)
A Survey of Web Data Management Systems
17(48)
Web Query Systems
18(17)
Search Engines
18(2)
Matasearch Engines
20(1)
W3QS
21(6)
WebSQL
27(1)
WebLog
28(2)
NetQL
30(2)
Florid
32(3)
Raw
35(1)
Web Information Integration Systems
35(5)
Information Manifold
36(1)
TSIMMIS
37(2)
Ariadne
39(1)
WHIRL
40(1)
Web Data Restructuring
40(7)
Strudel
41(3)
WebOQL
44(1)
Araneus
45(2)
Semistructured Data
47(3)
Lore
47(3)
UnQL
50(1)
XML Query Languages
50(11)
Lorel
52(4)
XML-QL
56(5)
Summary
61(4)
Node and Link Objects
65(28)
Introduction
65(4)
Motivation
65(4)
Our Approach - An Overview of WareHouse Object Model (WHOM)
69(1)
Representing Metadata of Web Documents and Hyperlinks
69(1)
Metadata Associated with HTML and XML Documents
69(1)
Node Metadata Attributes
70(1)
Link Metadata Attributes
70(1)
Representing Structure and Content of Web Documents
70(10)
Issues for Modeling Structure and Content
72(2)
Node Structural Attributes
74(5)
Location Attributes
79(1)
Representing Structure and Content of Hyperlinks
80(4)
Issues for Modeling Hyperlinks
81(1)
Link Structural Attributes
82(1)
Reference Identifier
82(2)
Node and Link Objects
84(1)
Node and Link Structure Trees
84(3)
Recent Approaches in Modeling Web Data
87(4)
Semistructrued Data Modeling
88(1)
Web Data Modeling
89(1)
XML Data Modeling
89(1)
Open Hypermedia System
90(1)
Summary
91(2)
Predicates on Node and Link Objects
93(34)
Introduction
94(6)
Features of Predicate
96(1)
Overview of Predicates
97(3)
Components of Comparison-Free Predicates
100(14)
Attribute Path Expressions
101(4)
Predicate Qualifier
105(1)
Value of a Comparison-Free Predicate
106(3)
Predicate Operators
109(5)
Comparison Predicates
114(11)
Components of a Comparison Predicate
115(2)
Types of Comparison Predicates
117(8)
Summary
125(2)
Imposing Constraints on Hyperlink Structures
127(18)
Introduction
127(6)
Overview
129(1)
Difficulties in Modeling Connectivities
129(3)
Features of Connectivities
132(1)
Components of Connectivities
133(2)
Source and Target Identifiers
134(1)
Link Path Expression
134(1)
Types of Connectivities
135(1)
Simple Connectivities
135(1)
Complex Connectivities
135(1)
Transformation of Complex Connectivities
136(5)
Transformation of Case 1
136(1)
Transformation of Case 2
137(1)
Transformation of Case 3
138(1)
Transformation of Case 4
139(1)
Steps of Transformation
139(2)
Graphical Visualization of a Connectivity
141(1)
Conformity Conditions
141(1)
Simple Connectivities
141(1)
Complex Connectivities
142(1)
Summary
142(3)
Query Machanism for the Web
145(62)
Introduction
145(9)
Motivation
145(4)
Our Approach
149(5)
Coupling Query
154(18)
The Information Space
154(1)
Components
155(11)
Definition of Coupling Query
166(3)
Types of Coupling Query
169(1)
Valid Canonical Coupling Query
170(2)
Examples of Coupling Queries
172(9)
Noncanonical Coupling Query
173(6)
Cononical Coupling Query
179(2)
Valid Canonical Query Generation
181(9)
Outline
181(1)
Phase 1: Coupling Query Reduction
182(7)
Phase 2: Validity Checking
189(1)
Coupling Query Formulation
190(10)
Definition of Coupling Graph
190(1)
Types of Coupling Graph
191(3)
Limitations of Coupling Graphs
194(4)
Hybrid Graph
198(2)
Coupling Query Results
200(1)
Computability of Valid Coupling Queries
201(2)
Browser and Browse/Search Coupling Queries
202(1)
Recent Approaches for Querying the Web
203(2)
Summary
205(2)
Schemas for Warehouse Data
207(44)
Preliminaries
208(6)
Recent Approaches for Modeling Schema for Web Data
208(2)
Features of Our Web Schema
210(2)
Summary of Our Methodology
212(1)
Importance of Web Schema in a Web Warehouse
213(1)
Web Schema
214(7)
Definition
214(2)
Types of Web Schema
216(1)
Schema Conformity
217(2)
Web Table
219(2)
Generation of Simple Web Schema Set from Coupling Query
221(1)
Phase 1: Valid Cononical Coupling Query to Schema Transformation
221(4)
Schema from Query Containing Schema-Independent Predicates
222(1)
Schema from Query Containing Schema-Influencing Predicates
223(2)
Phase 2: Complex Schema Decomposition
225(3)
Motivation
225(1)
Discussion
226(1)
Limitations
227(1)
Phase 3: Schema Pruning
228(8)
Motivation
228(1)
Classifications of Simple Schemas
228(3)
Schema Pruning Process
231(1)
Phase 1: Preprocessing Phase
232(1)
Phase 2: Matching Phase
233(1)
Phase 3: Nonoverlapping Partitioning Phase
233(3)
Algorithm Schema Generator
236(10)
Pruning Ratio
237(1)
Algorithm of Generate Schema From Query
238(2)
Algorithm for the Construct Partition
240(6)
Web Schema Genration in Local Operations
246(3)
Schema Generation Phase
246(2)
Schema Pruning Phase
248(1)
Summary
249(2)
Whom-Algebra
251(102)
Types of Manipulation
251(1)
Global Web Coupling
252(7)
Definition
252(1)
Global Web Coupling Operation
253(1)
Web Tuples Generation Phase
254(3)
Limitations
257(2)
Web Select
259(14)
Selection Criteria
259(1)
Web Select Operator
260(1)
Simple Web Schema Set
260(1)
Selection Schema
261(4)
Selection Condition Conformity
265(1)
Select Table Generation
265(8)
Web Project
273(14)
Definition
273(1)
Projection Attributes
273(5)
Algorithm for Web Project
278(9)
Web Distinct
287(1)
Web Cartesian Product
288(1)
Web Join
289(49)
Motivation and Overview
289(2)
Concept of Web Join
291(13)
Join Existence Phase
304(11)
Join Construction Phase When Xpj ≠ 0
315(12)
Joined Partition Pruning
327(3)
Join Construction Phase When Xj = 0
330(8)
Derivatives of Web Join
338(12)
σ-Web Join
338(6)
Outer Web Join
344(6)
Web Union
350(1)
Summary
351(2)
Web Data Visualization
353(14)
Web Data Visualization Operators
355(10)
Web Nest
355(1)
Web Unnest
356(1)
Web Coalesce
357(2)
Web Expand
359(1)
Web Pack
360(2)
Web Unpack
362(2)
Web Sort
364(1)
Summary
365(2)
Detecting and Representing Relevant Web Deltas
367(22)
Introduction
367(2)
Overview
368(1)
Related Work
369(2)
Change Detection Problem
371(3)
Problem Definition
371(1)
Types of Changes
372(1)
Representing Changes
372(2)
Decomposition of Change Detection Problem
374(1)
Generating Delta Web Tables
374(13)
Storage of Web Objects
374(1)
Outline of the Algorithm
375(4)
Algorithm Delta
379(8)
Conclusions and Future Work
387(2)
Knowledge Discovery Using Web Bags
389(28)
Introduction
389(3)
Motivation
390(1)
Overview
391(1)
Related Work
392(5)
PageRank
393(1)
Mutual Reinforcement Approach
393(1)
Rafiei and Mendelzon's Approach
394(1)
SALSA
395(1)
Approach of Borodin et al.
396(1)
Concept of Web Bag
397(2)
Knowledge Discovery Using Web Bags
399(16)
Terminology
399(1)
Visibility of Web Documents and Intersite Connectivity
400(6)
Luminosity of Web Documents
406(2)
Luminous Paths
408(5)
Query Language Design Considerations
413(1)
Query Language for Knowledge Discovery
414(1)
Conclusions and Future Work
415(2)
The Road Ahead
417(32)
Summary of the Book
417(3)
Contributions of the Book
420(1)
Extending Coupling Queries and Global Web Coupling Operation
420(1)
Optimizing Size of Simple Schema Set
421(1)
Extension of the Web Algebra
421(4)
Schema Operators
422(2)
Web Correlate
424(1)
Web Ranking Operator
424(1)
Operators for Manipulation at Subpage Level
424(1)
Maintenance of the Web Warehouse
425(1)
Retriving and Manipulating Data from the Hidden Web
425(1)
Data Mining in the Web Warehouse
426(1)
Conclusions
427(22)
Table of Symbols
429(2)
Regular Expressions in Comparison-Free Predicate Values
431(5)
Examples of Comparison-Free Predicates
436(7)
Examples of Comparison Operators
443(2)
Nodes and Links
445(4)
References 449(10)
Index 459

An electronic version of this book is available through VitalSource.

This book is viewable on PC, Mac, iPhone, iPad, iPod Touch, and most smartphones.

By purchasing, you will be able to view this book online, as well as download it, for the chosen number of days.

Digital License

You are licensing a digital product for a set duration. Durations are set forth in the product description, with "Lifetime" typically meaning five (5) years of online access and permanent download to a supported device. All licenses are non-transferable.

More details can be found here.

A downloadable version of this book is available through the eCampus Reader or compatible Adobe readers.

Applications are available on iOS, Android, PC, Mac, and Windows Mobile platforms.

Please view the compatibility matrix prior to purchase.