array(2) { ["docs"]=> array(10) { [0]=> array(10) { ["id"]=> string(3) "428" ["text"]=> string(77) "Visual Studio 2017 单独启动MSDN帮助(Microsoft Help Viewer)的方法" ["intro"]=> string(288) "目录 ECharts 异步加载 ECharts 数据可视化在过去几年中取得了巨大进展。开发人员对可视化产品的期望不再是简单的图表创建工具,而是在交互、性能、数据处理等方面有更高的要求。 chart.setOption({ color: [ " ["username"]=> string(8) "DonetRen" ["tagsname"]=> string(55) "Visual Studio 2017|MSDN帮助|C#程序|.NET|Help Viewer" ["tagsid"]=> string(23) "[401,402,403,"300",404]" ["catesname"]=> string(0) "" ["catesid"]=> string(2) "[]" ["createtime"]=> string(10) "1511400964" ["_id"]=> string(3) "428" } [1]=> array(10) { ["id"]=> string(3) "427" ["text"]=> string(42) "npm -v;报错 cannot find module "wrapp"" ["intro"]=> string(288) "目录 ECharts 异步加载 ECharts 数据可视化在过去几年中取得了巨大进展。开发人员对可视化产品的期望不再是简单的图表创建工具,而是在交互、性能、数据处理等方面有更高的要求。 chart.setOption({ color: [ " ["username"]=> string(4) "zzty" ["tagsname"]=> string(50) "node.js|npm|cannot find module "wrapp“|node" ["tagsid"]=> string(19) "[398,"239",399,400]" ["catesname"]=> string(0) "" ["catesid"]=> string(2) "[]" ["createtime"]=> string(10) "1511400760" ["_id"]=> string(3) "427" } [2]=> array(10) { ["id"]=> string(3) "426" ["text"]=> string(54) "说说css中pt、px、em、rem都扮演了什么角色" ["intro"]=> string(288) "目录 ECharts 异步加载 ECharts 数据可视化在过去几年中取得了巨大进展。开发人员对可视化产品的期望不再是简单的图表创建工具,而是在交互、性能、数据处理等方面有更高的要求。 chart.setOption({ color: [ " ["username"]=> string(12) "zhengqiaoyin" ["tagsname"]=> string(0) "" ["tagsid"]=> string(2) "[]" ["catesname"]=> string(0) "" ["catesid"]=> string(2) "[]" ["createtime"]=> string(10) "1511400640" ["_id"]=> string(3) "426" } [3]=> array(10) { ["id"]=> string(3) "425" ["text"]=> string(83) "深入学习JS执行--创建执行上下文(变量对象,作用域链,this)" ["intro"]=> string(288) "目录 ECharts 异步加载 ECharts 数据可视化在过去几年中取得了巨大进展。开发人员对可视化产品的期望不再是简单的图表创建工具,而是在交互、性能、数据处理等方面有更高的要求。 chart.setOption({ color: [ " ["username"]=> string(7) "Ry-yuan" ["tagsname"]=> string(33) "Javascript|Javascript执行过程" ["tagsid"]=> string(13) "["169","191"]" ["catesname"]=> string(0) "" ["catesid"]=> string(2) "[]" ["createtime"]=> string(10) "1511399901" ["_id"]=> string(3) "425" } [4]=> array(10) { ["id"]=> string(3) "424" ["text"]=> string(30) "C# 排序技术研究与对比" ["intro"]=> string(288) "目录 ECharts 异步加载 ECharts 数据可视化在过去几年中取得了巨大进展。开发人员对可视化产品的期望不再是简单的图表创建工具,而是在交互、性能、数据处理等方面有更高的要求。 chart.setOption({ color: [ " ["username"]=> string(9) "vveiliang" ["tagsname"]=> string(0) "" ["tagsid"]=> string(2) "[]" ["catesname"]=> string(8) ".Net Dev" ["catesid"]=> string(5) "[199]" ["createtime"]=> string(10) "1511399150" ["_id"]=> string(3) "424" } [5]=> array(10) { ["id"]=> string(3) "423" ["text"]=> string(72) "【算法】小白的算法笔记:快速排序算法的编码和优化" ["intro"]=> string(288) "目录 ECharts 异步加载 ECharts 数据可视化在过去几年中取得了巨大进展。开发人员对可视化产品的期望不再是简单的图表创建工具,而是在交互、性能、数据处理等方面有更高的要求。 chart.setOption({ color: [ " ["username"]=> string(9) "penghuwan" ["tagsname"]=> string(6) "算法" ["tagsid"]=> string(7) "["344"]" ["catesname"]=> string(0) "" ["catesid"]=> string(2) "[]" ["createtime"]=> string(10) "1511398109" ["_id"]=> string(3) "423" } [6]=> array(10) { ["id"]=> string(3) "422" ["text"]=> string(64) "JavaScript数据可视化编程学习(二)Flotr2,雷达图" ["intro"]=> string(288) "目录 ECharts 异步加载 ECharts 数据可视化在过去几年中取得了巨大进展。开发人员对可视化产品的期望不再是简单的图表创建工具,而是在交互、性能、数据处理等方面有更高的要求。 chart.setOption({ color: [ " ["username"]=> string(7) "chengxs" ["tagsname"]=> string(28) "数据可视化|前端学习" ["tagsid"]=> string(9) "[396,397]" ["catesname"]=> string(18) "前端基本知识" ["catesid"]=> string(5) "[198]" ["createtime"]=> string(10) "1511397800" ["_id"]=> string(3) "422" } [7]=> array(10) { ["id"]=> string(3) "421" ["text"]=> string(36) "C#表达式目录树(Expression)" ["intro"]=> string(288) "目录 ECharts 异步加载 ECharts 数据可视化在过去几年中取得了巨大进展。开发人员对可视化产品的期望不再是简单的图表创建工具,而是在交互、性能、数据处理等方面有更高的要求。 chart.setOption({ color: [ " ["username"]=> string(4) "wwym" ["tagsname"]=> string(0) "" ["tagsid"]=> string(2) "[]" ["catesname"]=> string(4) ".NET" ["catesid"]=> string(7) "["119"]" ["createtime"]=> string(10) "1511397474" ["_id"]=> string(3) "421" } [8]=> array(10) { ["id"]=> string(3) "420" ["text"]=> string(47) "数据结构 队列_队列实例:事件处理" ["intro"]=> string(288) "目录 ECharts 异步加载 ECharts 数据可视化在过去几年中取得了巨大进展。开发人员对可视化产品的期望不再是简单的图表创建工具,而是在交互、性能、数据处理等方面有更高的要求。 chart.setOption({ color: [ " ["username"]=> string(7) "idreamo" ["tagsname"]=> string(40) "C语言|数据结构|队列|事件处理" ["tagsid"]=> string(23) "["246","247","248",395]" ["catesname"]=> string(12) "数据结构" ["catesid"]=> string(7) "["133"]" ["createtime"]=> string(10) "1511397279" ["_id"]=> string(3) "420" } [9]=> array(10) { ["id"]=> string(3) "419" ["text"]=> string(47) "久等了,博客园官方Android客户端发布" ["intro"]=> string(288) "目录 ECharts 异步加载 ECharts 数据可视化在过去几年中取得了巨大进展。开发人员对可视化产品的期望不再是简单的图表创建工具,而是在交互、性能、数据处理等方面有更高的要求。 chart.setOption({ color: [ " ["username"]=> string(3) "cmt" ["tagsname"]=> string(0) "" ["tagsid"]=> string(2) "[]" ["catesname"]=> string(0) "" ["catesid"]=> string(2) "[]" ["createtime"]=> string(10) "1511396549" ["_id"]=> string(3) "419" } } ["count"]=> int(200) } 222 Readings in Database Systems - 爱码网

Data Models and DBMS Architecture

Joseph M. Hellerstein. What Goes Around Comes Around.

Michael Stonebraker. Anatomy of a Database System.

Query Processing

Access Path Selection in a Relational Database Management System.. Proc. SIGMOD Conference, 1979, 23-34.

Join Processing in Database Systems with Large Main Memories.. ACM Trans. Database Syst., 11(3), 1986, 239-264.

Parallel Database Systems: The Future of High Performance Database Systems.. Commun. ACM, 35(6), 1992, 85-98.

Encapsulation of Parallelism in the Volcano Query Processing System.. Proc. SIGMOD Conference, 1990, 102-111.

AlphaSort: A Cache-Sensitive Parallel External Sort. VLDB J., 4(4), 1995, 603-627.

R* Optimizer Validation and Performance Evaluation for Distributed Queries.. Proc. VLDB, 1986, 149-159.

Mariposa: A Wide-Area Distributed Database System. VLDB J., 5(1), 1996, 48-63.

Data Storage and Access Methods

The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles.. Proc. SIGMOD Conference, 1990, 322-331.

Operating System Support for Database Management.. Commun. ACM, 24(7), 1981, 412-418.

The Five-Minute Rule Ten Years Later, and Other Computer Storage Rules of Thumb.. SIGMOD Record, 26(4), 1997, 63-68.

A Case for Redundant Arrays of Inexpensive Disks (RAID).. Proc. SIGMOD Conference, 1988, 109-116.

Transaction Management

Granularity of Locks and Degrees of Consistency in a Shared Data Base.. IBM, September, 1975.

On Optimistic Methods for Concurrency Control.. Proc. VLDB, 1979, 351.

Concurrency Control Performance Modeling: Alternatives and Implications.. ACM Trans. Database Syst., 12(4), 1987, 609-654.

Efficient Locking for Concurrent Operations on B-Trees.. ACM Trans. Database Syst., 6(4), 1981, 650-670.

ARIES: A Transaction Recovery Method Supporting Fine-Granularity Locking and Partial Rollbacks Using Write-Ahead Logging.. ACM Trans. Database Syst., 17(1), 1992, 94-162.

Transaction Management in the R* Distributed Database Management System.. ACM Trans. Database Syst., 11(4), 1986, 378-396.

The Dangers of Replication and a Solution.. Proc. SIGMOD Conference, 1996, 173-182.

Extensible Systems

Inclusion of New Types in Relational Data Base Systems.. Proc. ICDE, 1986, 262-269.

Generalized Search Trees for Database Systems.. Proc. VLDB, 1995, 562-573.

Grammar-like Functional Rules for Representing Query Optimization Alternatives.. Proc. SIGMOD Conference, 1988, 18-27.

Database Evolution

AutoAdmin 'What-if' Index Analysis Utility.. Proc. SIGMOD Conference, 1998, 367-378.

Applying Model Management to Classical Meta Data Problems.. Proc. CIDR, 2003.

Algorithms for Creating Indexes for Very Large Tables Without Quiescing Updates.. Proc. SIGMOD Conference, 1992, 361-370.

Data Warehousing

An Overview of Data Warehousing and OLAP Technology.. SIGMOD Record, 26(1), 1997, 65-74.

Improved Query Performance with Variant Indexes.. Proc. SIGMOD Conference, 1997, 38-49.

Data Cube: A Relational Aggregation Operator Generalizing Group-by, Cross-Tab, and Sub Totals.. Data Min. Knowl. Discov., 1(1), 1997, 29-53.

An Array-Based Algorithm for Simultaneous Multidimensional Aggregates.. Proc. SIGMOD Conference, 1997, 159-170.

Deriving Production Rules for Constraint Maintainance.. Proc. VLDB, 1990, 566-577.

Informix under CONTROL: Online Query Processing.. Data Min. Knowl. Discov., 4(4), 2000, 281-314.

DynaMat: A Dynamic View Management System for Data Warehouses.. Proc. SIGMOD Conference, 1999, 371-382.

Data Mining

BIRCH: An Efficient Data Clustering Method for Very Large Databases.. Proc. SIGMOD Conference, 1996, 103-114.

SPRINT: A Scalable Parallel Classifier for Data Mining. Proc. VLDB, 1996, 544-555.

Fast Algorithms for Mining Association Rules in Large Databases.. Proc. VLDB, 1994, 487-499.

Efficient Evaluation of Queries with Mining Predicates.. Proc. ICDE, 2002, 529-.

Web Services and Databases

Combining Systems and Databases: A Search Engine Retrospective.

The Anatomy of a Large-Scale Hypertextual Web Search Engine.. Computer Networks, 30(1-7), 1998, 107-117.

The BINGO! System for Information Portal Generation and Expert Web Search.. Proc. CIDR, 2003.

Data Management in Application Servers.

Querying Semi-Structured Data.. Proc. ICDT, 1997, 1-18.

DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases.. Proc. VLDB, 1997, 436-445.

NiagaraCQ: A Scalable Continuous Query System for Internet Databases.. Proc. SIGMOD Conference, 2000, 379-390.

Stream-Based Data Management

Scalable Trigger Processing.. Proc. ICDE, 1999, 266-275.

The Design and Implementation of a Sequence Database System.. Proc. VLDB, 1996, 99-110.

Eddies: Continuously Adaptive Query Processing. Proc. SIGMOD Conference, 2000, 261-272.

Monitoring Streams - A New Class of Data Management Applications.. Proc. VLDB, 2002, 215-226.

相关文章: