首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   4篇
  免费   0篇
教育   3篇
信息传播   1篇
  2019年   1篇
  2009年   1篇
  2005年   1篇
  1998年   1篇
排序方式: 共有4条查询结果,搜索用时 0 毫秒
1
1.
2.
在目前重视实践教学、以学为主的大类招生的背景下,作为应用性较强的园艺专业,建设示范性实习实训基地是提高学生实践能力、培养学生职业素质的重要载体。本文结合教学实际,对校内外示范性实习实训基地建设的实际及教学效果进行总结和分析,以期为农业高校园艺专业的实践教学和人才培养提供借鉴。  相似文献   
3.
INTRODUCTION The CUBE BY operator (Gray et al., 1996) is anessential facility for data warehousing and OLAP. Itis a multidimensional extension of the standardGROUP BY operator, computing all possible com-binations of the grouping attributes in the CUBE BYclause. A CUBE BY with N grouping attributes willcompute 2N group-bys. In the real world, a fact tableis often very large and sparse. In such cases, the sizeof a group-by is possibly close to the size of the facttable. So th…  相似文献   
4.
Finding all occurrences of a twig query in an XML database is a core operation for efficient evaluation of XML queries. It is important to effectively handle twig queries with wildcards. In this paper, a novel path-partitioned encoding scheme is proposed for XML documents to capture paths of all elements, and a twig query is modeled as an XPattern extended from tree pattern. After definition, simplification, normalization, verification and initialization of the XPattern, both work sets and a join plan are generated. According to these measures, an effective algorithm to answer for a twig query, called DMTwig, is designed without unnecessary elements and invalid structural joins. The algorithm can adaptively deal with twig queries with branch([]), child edge(/), descendant edge(//), and wildcard(*)synthetically. We show that path-partitioned encoding scheme and XPattern guarantee the I/O and CPU optimality for twig queries. Experiments on representative data set indicate that the proposed solution performs significantly.  相似文献   
1
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号