检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

28 篇 会议
7 册 图书

馆藏范围

35 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

28 篇 工学
- 27 篇 计算机科学与技术...
- 17 篇 软件工程
- 3 篇 信息与通信工程
- 3 篇 化学工程与技术
- 2 篇 建筑学
- 1 篇 光学工程
- 1 篇 控制科学与工程
- 1 篇 土木工程
- 1 篇 农业工程
- 1 篇 生物医学工程（可授...
- 1 篇 生物工程
11 篇 理学
- 10 篇 数学
- 3 篇 化学
- 1 篇 生物学
- 1 篇 统计学（可授理学、...
9 篇 管理学
- 7 篇 图书情报与档案管...
- 3 篇 管理科学与工程(可...
- 3 篇 工商管理
2 篇 经济学
- 2 篇 应用经济学
1 篇 农学
- 1 篇 作物学

主题

13 篇 database systems
7 篇 database managem...
6 篇 information stor...
4 篇 mathematical log...
4 篇 artificial intel...
3 篇 computation by a...
2 篇 information syst...
2 篇 data mining and ...
2 篇 pattern recognit...
2 篇 relational datab...
2 篇 user interfaces ...
1 篇 database securit...
1 篇 query languages
1 篇 database design
1 篇 relations
1 篇 computer communi...
1 篇 computational ge...
1 篇 equality-generat...
1 篇 computer applica...
1 篇 data redundancy

机构

2 篇 department of co...
2 篇 department of co...
1 篇 electrical engin...
1 篇 department of co...
1 篇 department of co...
1 篇 kent state univ ...
1 篇 tsinghua univers...
1 篇 renmin univ chin...
1 篇 cerias cs and ec...
1 篇 hong kong univ s...
1 篇 school of inform...
1 篇 institut für inf...
1 篇 city univ hong k...
1 篇 univ calif irvin...
1 篇 korea database a...
1 篇 wuhan univ state...
1 篇 natl tsing hua u...
1 篇 department of co...
1 篇 univ westminster...
1 篇 griffith univ sc...

作者

2 篇 kriegel hans-pet...
2 篇 dominik ślęzak
1 篇 luo y
1 篇 lizhu zhou
1 篇 renz matthias
1 篇 schubert matthia...
1 篇 dashti ali e.
1 篇 meng xiaofeng
1 篇 guo hong
1 篇 güntzer ulrich
1 篇 li dy
1 篇 elisabeth métais
1 篇 haritsa jayant r...
1 篇 guoyin wang
1 篇 lian xiang
1 篇 jingtao yao
1 篇 zimmermann roger
1 篇 balke wolf-tilo
1 篇 gulías victor m.
1 篇 hacigümüs h

语言

34 篇 英文
1 篇 中文

检索条件"任意字段=10th International Conference on Database Systems for Advanced Applications, DASFAA 2005"

共 35 条记录，以下是21-30 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

引用

19th international conference on advanced Information Networking and applications

作者： Sheu, S Chang, A Huang, W Natl Tsing Hua Univ Hsinchu Taiwan

ISBN: (纸本)0769522491

Efficient similarity search in large string databases requires effective index support. Since long strings have each numerous substrings of arbitrary length, the effective index designs are of great challenge. the existing solution, namely MRS [10], employs a low-cost lower bound function to sieve out the most similar candidates from the majority of unlikely database substrings. therefore, only very small portions of string databases require the expensive true edit distance computation to finalize the query. A significant savings in overall query processing cost can be realized by the filtration feature of lower bound functions. In this paper, we seek to improve MRS to its full potential. Specifically, we propose a very simple method that exchanges the roles of database strings and query string in the original MRS design. Despite simplicity, our solution can further improve the query performance by 10 times in terms of disk page accesses while using only half of the original index's size.

关键词： database systems

来源：评论

学校读者我要写书评

暂无评论

An Efficient Design and Implementation of Multi-level Cache for database systems 20th

An Efficient Design and Implementation of Multi-level Cache ...

引用

20th international conference on database systems for advanced applications (dasfaa)

作者： Wang, Jiangtao Guo, Zhiliang Meng, Xiaofeng Renmin Univ China Sch Informat Beijing Peoples R China

ISBN: (纸本)9783319181202;9783319181196

Flash-based solid state device(SSD) is making deep inroads into enterprise database applications due to its faster data access. the capacity and performance characteristics of SSD make it well-suited for use as a second-level buffer cache. In this paper, we propose a SSD-based multilevel buffer scheme, called flash-aware second-level cache(FASC), where SSD serves as an extension of the DRAM buffer. Our goal is to reduce the number of disk accesses by caching the pages evicted from DRAM in the SSD, thereby enhancing the performance of database systems. For this purpose, a cost-aware main memory replacement policy is proposed, which can efficiently reduce the cost of page evictions. To take full advantage of the SSD, a block-based data management policy is designed to save the memory overheads, as well as reducing the write amplification of flash memory. To identify the hot pages for providing great performance benefits, a memory-efficient replacement policy is proposed for the SSD. Moreover, we also present a light-weight recovery policy, which is used to recover the data cached in the SSD in case of system crash. We implement a prototype based on PostgreSQL and evaluate the performance of FASC. the experimental results show that FASC achieves significant performance improvements.

关键词： Solid state driver Flash Cost Cache

来源：评论

学校读者我要写书评

暂无评论

Study on the international standardization for the semantic metadata mapping procedure

Study on the international standardization for the semantic ...

引用

17th international conference on database systems for advanced applications, dasfaa 2012

作者： Lim, Sungjoon Seo, Taesul Lee, Changhan Shin, Soungsoo Korea Database Agency KNTO Bldg. 10 Da-dong Jung-gu Seoul 100-180 Korea Republic of Korea Institute of Science and Technology Information 66 Hoegi-ro Dondaemun-gu Seoul 130-741 Korea Republic of

ISBN: (纸本)9783642290343

this paper introduces a semantic metadata mapping procedure which is able to maximize the interoperability among metadata. the methodology consists of three processes such as identifying metadata element sets, grouping data elements, and mapping semantically. And also this paper shows applicable example for the e-book cataloging domain. the methodology in this paper is recommended for use in a specific subject domain because the procedure can be more meaningful when a specific information object is concerned. © 2012 Springer-Verlag.

关键词： Metadata

来源：评论

学校读者我要写书评

暂无评论

Efficiently Discovering Regions of Interest with User-Defined Score Function 26th

Efficiently Discovering Regions of Interest with User-Define...

引用

26th international conference on database systems for advanced applications (dasfaa)

作者： Liu, Qiyu Zheng, Libin Lian, Xiang Chen, Lei Hong Kong Univ Sci & Technol Kowloon Hong Kong Peoples R China Kent State Univ Kent OH USA

ISBN: (纸本)9783030731939;9783030731946

Region of Interest (ROI) queries are of great importance in many location based services. However, the previous studies on ROI queries usually adopt either a simple spatial data model or a non-flexible enough query geometry, e.g., fixed-size rectangle. In this paper, to fix these drawbacks, we propose a new ROI search operator called Radius Bounded ROI (RBR) query. An RBR query retrieves a subset of spatial objects satisfying co-location constraints and maximizing a user-configurable score function at the same time. We formally prove that answering an RBR query is 3SUM-hard, which implies that it is unlikely to find a sub-quadratic solution. To answer the RBR queries efficiently, we propose three algorithms, PairEnum, BaseRotation and OptRotation based on novel geometric findings. In addition, the query processing technique we proposed can be easily extended to other related problems like top-k ROI search. To demonstrate both efficiency and effectiveness of our proposed algorithms, we conduct extensive experimental studies on both real-world datasets and synthetic benchmarks, and the results show that OptRotation, our most efficient algorithm, achieves more than 10(3) x efficiency improvement on both real and synthetic datasets compared with the baseline algorithm.

关键词： ROI queries Spatial database Computational geometry

来源：评论

学校读者我要写书评

暂无评论

database systems for advanced applications 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Weiyi Meng Ling Feng Stéphane Bressan Werner Winiwarter Wei Song

ISBN: (数字)9783642374876

ISBN: (纸本)9783642374869

this two volume set LNCS 7825 and LNCS 7826 constitutes the refereed proceedings of the 18th international conference on database systems for advanced applications, dasfaa 2013, held in Wuhan, China, in April 2013. the 51 revised full papers and 10 short papers presented together with 2 invited keynote talks, 1 invited paper, 3 industrial papers, 9 demo presentations, 4 tutorials and 1 panel paper were carefully reviewed and selected from a total of 227 submissions. the topics covered in part 1 are social networks; query processing; nearest neighbor search; index; query analysis; XML data management; privacy protection; and uncertain data management; and in part 2: graph data management; physical design; knowledge management; temporal data management; social networks; query processing; data mining; applications; and database applications.

关键词： database Management Data Mining and Knowledge Discovery Information Storage and Retrieval Information systems applications (incl. Internet) Multimedia Information systems User Interfaces and Human Computer Interaction

来源：评论

学校读者我要写书评

暂无评论

Mining closed frequent free trees in graph databases

引用

12th international conference on database systems for advanced applications, dasfaa 2007

作者： Peixiang, Zhao Jeffrey, Xu Yu Chinese University of Hong Kong Hong Kong

ISBN: (纸本)9783540717027

Free tree, as a special graph which is connected, undirected and acyclic, has been extensively used in bioinformatics, pattern recognition, computer networks, XML databases, etc. Recent research on structural pattern mining has focused on an important problem of discovering frequent free trees in large graph databases. However, it can be prohibitive due to the presence of an exponential number of frequent free trees in the graph database. In this paper, we propose a computationally efficient algorithm that discovers only closed frequent free trees in a database of labeled graphs. A free tree t is closed if there exist no supertrees of t that has the same frequency of t. Two pruning algorithms, the safe position pruning and the safe label pruning, are proposed to efficiently detect unsatisfactory search spaces with no closed frequent free trees generated. Based on the special characteristics of free tree, the automorphism-based pruning and the canonical mapping-based pruning are introduced to facilitate the mining process. Our performance study shows that our algorithm not only reduces the number of false positives generated but also improves the mining efficiency, especially in the presence of large frequent free tree patterns in the graph database. © Springer-Verlag Berlin Heidelberg 2007.

关键词： database systems

来源：评论

学校读者我要写书评

暂无评论

Incomplete databases: Missing records and missing values

Incomplete databases: Missing records and missing values

引用

17th international conference on database systems for advanced applications, dasfaa 2012

作者： Nutt, Werner Razniewski, Simon Vegliach, Gil Free University of Bozen-Bolzano Dominikanerplatz 3 Bozen39100 Italy

ISBN: (纸本)9783642290220

Data completeness is an essential aspect of data quality as in many scenarios it is crucial to guarantee the completeness of query answers. Data might be incomplete in two ways: records may be missing as a whole, or attribute values of a record may be absent, indicated by a null. We extend previous work by two of the authors [10] that dealt only with the first aspect, to cover both missing records and missing attribute values. To this end, we refine the formalization of incomplete databases and identify the important special case where values of key attributes are always known. We show that in the presence of nulls, completeness of queries can be defined in several ways. We also generalize a previous approach stating completeness of parts of a database, using so-called table completeness statements. With this formalization in place, we define the main inferences for completeness reasoning over incomplete databases and present first results. © Springer-Verlag Berlin Heidelberg 2012.

关键词： database systems

来源：评论

学校读者我要写书评

暂无评论

Multi-lingual database querying and the atoms of language

引用

10th international conference on applications of Natural Language to Information systems

作者： Kapetanios, E Chountas, P Univ Westminster Sch Comp Sci HSCS Hlth Care Comp Grp London W1R 8AL England

ISBN: (纸本)3540260315

the paper presents MDDQL as a query language suitable for multilingual conceptual querying of collections of databases from a graphical user interface or from an application programming one. the query language, however, has been specified and implemented with the parametric theory of linguistic diversity in mind such that syntactic and semantic parsing of multi-lingual query expressions becomes quite simple and guarantees identical query results regardless the preferred natural language. We present a parsing algorithm, which shows that it is quite easy to formulate a query regardless the underlying type order of a natural language, be it Subject-Object-Verb, Subject-Verb-Object, or Object-Verb-Subject, etc., and still being able to grasp the meaning of the query at a minimal computational effort possible.

关键词： Linguistics

来源：评论

学校读者我要写书评

暂无评论

CheapTB: A low cost of operation distributed filesystem 1

引用

10th international conference on Computer Aided systems theory - EUROCAST 2005

作者： Paris, Javier Gulías, Victor M. Abalde, Carlos Laboratorio de Fundamentos de Computación e Inteligcncia Artificial MADS Group Universidade de A Coruña

ISBN: (数字)9783540318293

ISBN: (纸本)3540290028

the overall computing power available today has mado possible tor small enterprises and laboratories to develop applications that need big amounts of storage. this storage has traditionally been expensive, using propietary technologies. With the recent increase in storage space of cheap IDE and SCSI disks it is now possible to build a cluster to be used as a storage solution. CheapTB is a distributed filesystern for this environment, with an emphasys towards low cost operation rather than performance. © Springer-Verlag Berlin Heidulborg 2005.

关键词： Distributed database systems

来源：评论

学校读者我要写书评

暂无评论

Combining biological databases and text mining to support new bioinformatics applications

Combining biological databases and text mining to support ne...

引用

10th international conference on applications of Natural Language to Information systems, NLDB 2005: Natural Language Processing and Information systems

作者： Witte, René Baker, Christopher J.O. Germany Department of Computer Science and Software Engineering Concordia University Montréal Que. Canada

A large amount of biological knowledge today is only available from full-text research papers. Since neither manual database curators nor users can keep up with the rapidly expanding volume of scientific literature, natural language processing approaches are becoming increasingly important for bioinformatic projects. In this paper, we go beyond simply extracting information from full-text articles by describing an architecture that supports targeted access to information from biological databases using the results derived from text mining of research papers, thereby integrating information from both sources within a biological application. the described architecture is currently being used to extract information about protein mutations from full-text research papers. Text mining results drive the retrieval of sequence information from protein databases and the employment of algorithmic sequence analysis tools, which facilitate further data access from protein structure databases. Complex mapping of NLP derived text annotations to protein structures allows the rendering, with 3D structure visualization, of information not available in databases of mutation annotations. © Springer-Verlag Berlin Heidelberg 2005.

关键词： database systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共4页 << < 1 2 3 4 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：