图书介绍
XML数据查询和检索技术 英文版PDF|Epub|txt|kindle电子书版本网盘下载
- 陆嘉恒主编 著
- 出版社： 北京：清华大学出版社
- ISBN：9787302285632
- 出版时间：2013
- 标注页数：291页
- 文件大小：46MB
- 文件页数：304页
- 主题词：智能检索系统－可扩充－语言－程序设计－英文
PDF下载
下载说明
XML数据查询和检索技术 英文版PDF格式电子书版下载
下载的文件为RAR压缩包。需要使用解压软件进行解压得到PDF格式图书。建议使用BT下载工具Free Download Manager进行下载,简称FDM(免费,没有广告,支持多平台）。本站资源全部打包为BT种子。所以需要使用专业的BT下载软件进行下载。如BitComet qBittorrent uTorrent等BT下载工具。迅雷目前由于本站不是热门资源。不推荐使用！后期资源热门了。安装了迅雷也可以迅雷进行下载！
（文件页数 要大于 标注页数，上中下等多册电子书除外）
注意：本站所有压缩包均有解压码： 点击下载压缩包解压工具
图书目录
1 Introduction1
1.1 XML Data Model1
1.2 Emergence of XML Database3
1.2.1 Flat File Storage3
1.2.2 Relational and Object Relational Storage3
1.2.3 Native Storage of XML Data4
1.3 XML Query Language and Processing5
1.4 XML Keyword Search5
1.5 Book Outline6
References7
2 XML Labeling Scheme9
2.1 Introducing XML Labeling Scheme9
2.2 Region Encoding Scheme10
2.3 Dewey and Extended Dewey Scheme11
2.3.1 Dewey ID Labeling Scheme11
2.3.2 Extended Dewey and FST12
2.4 Dynamic Labeling Scheme16
2.4.1 Region-Based Dynamic Labeling Scheme17
2.4.2 Prefix-Based Dynamic Labeling Scheme18
2.4.3 Prime Labeling Scheme19
2.4.4 The Encoding Schemes20
2.5 Summary31
References31
3 XML Data Indexing33
3.1 Introducing XML Data Indexing33
3.2 Indexes on XML Tree Structure34
3.2.1 DataGuides34
3.2.2 1-Index39
3.2.3 F＆B-Index43
3.3 Index Based on XML Sequencing54
3.3.1 PRIX：Indexing and Querying XML Using Prüfer Sequences54
3.3.2 ViST：A Dynamic Index Method for Querying XML Data by Tree Structures65
3.3.3 APEX：An Adaptive Path Index for XML Data75
3.4 Summary87
References88
4 XML Tree Pattern Processing91
4.1 Introducing XML Tree Pattern Processing91
4.2 XML Structural Join92
4.2.1 Tree-Merge Join Algorithms94
4.2.2 Stack-Tree Join Algorithms97
4.3 XML Holistic Twig Pattern Processing103
4.3.1 Path Stack104
4.3.2 TwigStack108
4.3.3 TwigStackList112
4.3.4 TJFast122
4.3.5 Experimental Evaluation128
4.4 XML Query Processing Based on Various Streaming Schemes134
4.4.1 Tag+Level Streaming and Prefix-Path Streaming（PPS）135
4.4.2 iTwigJoin Algorithm144
4.5 Summary155
References155
5 Ordered and Generalized XML Tree Pattern Processing157
5.1 Introducing Ordered and Generalized XML Tree Pattern Processing157
5.2 XML Ordered Query Processing158
5.2.1 Data Model and Ordered Twig Pattern159
5.2.2 XML Ordered Query Processing Algorithm160
5.2.3 Analysis of Ordered TJ163
5.2.4 Experimental Evaluation165
5.3 XML Generalized XML Tree Pattern167
5.3.1 GTJFast Algorithm168
5.3.2 Analysis of GTJFast171
5.3.3 Experiments173
5.4 Extended XML Tree Pattern174
5.4.1 Extended Tree Pattern Query176
5.4.2 Matching Cross177
5.4.3 Holistic Algorithms183
5.4.4 Experiments193
5.5 Summary200
References200
6 Effective XML Keyword Search203
6.1 Introducing Effective XML Keyword Search203
6.2 XML Keyword Search Semantics204
6.2.1 LCA and the Meet Operator205
6.2.2 MLCA and MLCAS205
6.2.3 SLCA206
6.2.4 GDMCT207
6.2.5 ICA（Interested Common Ancestor）and IRA（Interested Related Ancestors）209
6.2.6 ELCA（Exclusive Lowest Common Ancestor）210
6.2.7 VLCA（Valuable Lowest Common Ancestor）210
6.2.8 MCN211
6.2.9 Meaningful SLCA211
6.2.10 LCEA（Lowest Common Entity Ancestor）213
6.2.11 MLCEA （Meaningful LCEA）213
6.3 XML Keyword Search Algorithms213
6.3.1 DIL（Dewey Inverted List）Query Processing Algorithm213
6.3.2 The Stack Algorithm216
6.3.3 Basic Multiway-SLCA Algorithm（BMS）218
6.3.4 Incremental Multiway-SLCA Algorithm（IMS）220
6.3.5 Indexed Stack Algorithm221
6.3.6 Stack-Based Query Refinement Algorithm223
6.4 XML Keyword Search Ranking Strategy224
6.4.1 TFIDF Cosine Similarity225
6.4.2 Data Model226
6.4.3 XML TF＆DF226
6.4.4 Inferring the Node Type to Search For227
6.4.5 Inferring the Node Types to Search Via227
6.4.6 Capturing Keyword Co-occtrrence228
6.4.7 Relevance-Oriented Ranking228
6.5 Summary231
References231
7 XML Keyword Pattern Refinement233
7.1 Introducing XML Keyword Pattern Refinement233
7.2 Related Work237
7.3 Preliminaries238
7.3.1 Meaningful SLCA238
7.3.2 Refinement Operations240
7.4 Ranking of Refined Queries242
7.4.1 Similarity Score of a RQ243
7.4.2 Dependence Score of a RQ245
7.5 Exploring the Refined Query247
7.5.1 Problem Formulation247
7.5.2 Subproblems247
7.5.3 Notations247
7.5.4 Initialization248
7.5.5 Recurrence Function248
7.5.6 Time Complexity248
7.6 Content-Aware Query Refinement249
7.6.1 Partition-Based Algorithm250
7.6.2 Short-List Eager Algorithm253
7.7 Experiments256
7.7.1 Equipment256
7.7.2 Dataset and Query Set256
7.7.3 Efficiency257
7.7.4 Scalability259
7.7.5 Effectiveness of Query Refinement261
7.8 Summary264
References264
8 LCRA,XML Keyword Search System,and LotusX,Graphical Query Processing System267
8.1 Introduction of LCRA and LotusX267
8.2 LCRA：Search Semantics268
8.2.1 SLCA and LRA268
8.2.2 Background and Data Model269
8.2.3 Search Semantics270
8.3 LCRA,System Architecture,and Ranking Techniques272
8.3.1 Tree Model272
8.3.2 Ranking Techniques273
8.3.3 System Architecture274
8.3.4 Overview of Online Demo Features274
8.4 A Position-Aware XML Graphical Search System with Auto-completion276
8.4.1 System Features276
8.4.2 LotusX：Architecture and Algorithms278
8.5 Summary282
References283
9 Summary and the Road Ahead285
9.1 Summary of This Book285
9.2 Future Work286
9.2.1 Full-Fledge dXML Query Engine286
9.2.2 Directed Graph XML Model286
9.2.3 Extended Dewey Labeling Scheme for Ordered Query287
9.2.4 Index Structure Based on TJFast287
9.2.5 MapReduce-Based XML Twig Pattern Matching288
References288
Index289