標題: Titlebook: Data Management. Data, Data Everywhere; 24th British Nationa Richard Cooper,Jessie Kennedy Conference proceedings 2007 Springer-Verlag Berl [打印本頁] 作者: ONSET 時間: 2025-3-21 19:07
書目名稱Data Management. Data, Data Everywhere影響因子(影響力)
書目名稱Data Management. Data, Data Everywhere影響因子(影響力)學科排名
書目名稱Data Management. Data, Data Everywhere網(wǎng)絡公開度
書目名稱Data Management. Data, Data Everywhere網(wǎng)絡公開度學科排名
書目名稱Data Management. Data, Data Everywhere被引頻次
書目名稱Data Management. Data, Data Everywhere被引頻次學科排名
書目名稱Data Management. Data, Data Everywhere年度引用
書目名稱Data Management. Data, Data Everywhere年度引用學科排名
書目名稱Data Management. Data, Data Everywhere讀者反饋
書目名稱Data Management. Data, Data Everywhere讀者反饋學科排名
作者: 起草 時間: 2025-3-21 20:41 作者: BIAS 時間: 2025-3-22 01:04
OOXSearch: A Search Engine for Answering Loosely Structured XML Queries Using OO Programmingarch engine called OOXSearch, which answers loosely structured queries. The recall and precision of the engine were evaluated experimentally and compared with two recent proposed systems [1, 2] and the results showed marked improvement.作者: 想象 時間: 2025-3-22 07:27 作者: 密碼 時間: 2025-3-22 09:33 作者: insurgent 時間: 2025-3-22 14:04
Volker Krüger,Shaohua Zhou,Rama Chellappang a multidimensional index. We improve the recognition speed of the proposed algorithm using the association rule technique, which is a widely adopted data mining technique. The proposed algorithm has the advantage that it can be applied regardless of the language, size, and font of the characters 作者: insurgent 時間: 2025-3-22 19:10
Greedy Kernel Principal Component Analysisof SBML documents, pathway reconstruction/visualization. SPDBSW has been implemented by the combination SPDBS and external web services such as OLS, KEGG and NCBI. And user can get more confidential and delicate information from KEGG or NCBI through their web services. The system can be extended or 作者: 粘 時間: 2025-3-23 00:13
Frank H. P. Fitzek,Marcos D. Katzarch engine called OOXSearch, which answers loosely structured queries. The recall and precision of the engine were evaluated experimentally and compared with two recent proposed systems [1, 2] and the results showed marked improvement.作者: 兒童 時間: 2025-3-23 01:59
https://doi.org/10.1007/978-3-319-58685-4op-down path matching and bottom-up path selections to efficiently evaluate linear path expressions. For twig queries, we perform structural joins at branch points. Through experimental evaluation on standard datasets, we show that our approach outperforms the existing path-index based approaches wh作者: Mercantile 時間: 2025-3-23 08:42 作者: Oligarchy 時間: 2025-3-23 11:26
Conference proceedings 2007and the ways in which it is represented, with XML data management becoming an important issue and, as such, heavily represented at this conference. It has also brought back issues of performance that might have been considered largely solved by the improvements in hardware, since data now has to be 作者: 沉著 時間: 2025-3-23 14:42 作者: 注射器 時間: 2025-3-23 19:32
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/262885.jpg作者: 僵硬 時間: 2025-3-24 00:41 作者: 強制性 時間: 2025-3-24 05:08
978-3-540-73389-8Springer-Verlag Berlin Heidelberg 2007作者: 個人長篇演說 時間: 2025-3-24 07:55
Specifying and Optimising XML ViewsXML performs poorly when queried in its native format, and local and global views are not supported by current XML products. In this paper, we support the concept of data everywhere by providing a view mechanism for XML together with a highly-optimised query processing strategy.作者: CLOUT 時間: 2025-3-24 12:46 作者: 發(fā)起 時間: 2025-3-24 18:17 作者: 刪減 時間: 2025-3-24 22:57
https://doi.org/10.1007/978-1-4614-8890-3priate for large scale scientific data analysis, and has been tested with 1.4 GB of amino-acids. Protein sequences are indexed as short overlapping string windows, and stored in a relation. To find approximate matches, we use a neighbourhood generation algorithm. The words in the neighbourhood are t作者: 慢跑鞋 時間: 2025-3-25 01:27
Henrik I. Christensen,Hans-Hellmut Nagelibuted and heterogeneous. In previous work, we present a DLT approach using partial schema transformation pathways. In this paper, we extend our DLT approach to using full schema transformation pathways and discuss the problem of lineage data ambiguities. Our DLT approach is not limited in one speci作者: bibliophile 時間: 2025-3-25 06:04 作者: enflame 時間: 2025-3-25 10:51 作者: Mortar 時間: 2025-3-25 14:52 作者: GOUGE 時間: 2025-3-25 18:29 作者: 變化 時間: 2025-3-25 21:57 作者: 宏偉 時間: 2025-3-26 03:50
B. S. Manoj,Ramesh R. Rao,Michele Zorzid to the document - DOM based approaches that have to load and store large parts of the document in main memory will fail. In comparison, we pre sent an approach to evaluate XPath queries on SAX streams that supports all axes of core XPath, including the sibling axes. Starting from the XPath query, 作者: 疏忽 時間: 2025-3-26 06:48 作者: Fluctuate 時間: 2025-3-26 10:25 作者: Inordinate 時間: 2025-3-26 16:29
https://doi.org/10.1007/978-3-319-58685-4XML performs poorly when queried in its native format, and local and global views are not supported by current XML products. In this paper, we support the concept of data everywhere by providing a view mechanism for XML together with a highly-optimised query processing strategy.作者: Banquet 時間: 2025-3-26 17:00 作者: Vasodilation 時間: 2025-3-26 22:23 作者: Suppository 時間: 2025-3-27 04:34 作者: JECT 時間: 2025-3-27 05:18 作者: Aerate 時間: 2025-3-27 11:10 作者: 大火 時間: 2025-3-27 17:07 作者: 自然環(huán)境 時間: 2025-3-27 17:52
Data Management. Data, Data Everywhere978-3-540-73390-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 劇毒 時間: 2025-3-27 23:47
https://doi.org/10.1007/978-3-319-58685-4XML performs poorly when queried in its native format, and local and global views are not supported by current XML products. In this paper, we support the concept of data everywhere by providing a view mechanism for XML together with a highly-optimised query processing strategy.作者: Additive 時間: 2025-3-28 02:12 作者: Perigee 時間: 2025-3-28 08:01
Automation Everywhere: Autonomics and Data Managementre provided, but only in response to careful design, procurement, deployment and administration. This has been very successful in many contexts, but in an environment in which data is available in increasing quantities under the management of a growing collection of applications, and where effective作者: Ophthalmologist 時間: 2025-3-28 12:27
Exhaustive Peptide Searching Using Relationspriate for large scale scientific data analysis, and has been tested with 1.4 GB of amino-acids. Protein sequences are indexed as short overlapping string windows, and stored in a relation. To find approximate matches, we use a neighbourhood generation algorithm. The words in the neighbourhood are t作者: Misgiving 時間: 2025-3-28 14:48 作者: 使虛弱 時間: 2025-3-28 20:06
Fast Recognition of Asian Characters Based on Database Methodologiesmainly on increasing the recognition rate. However, as in the recent Google Library Project, the requirement for speeding up recognition of enormous amount of documents is growing. Moreover, the existing algorithms do not pay enough attention to Asian characters. In this paper, we propose an algorit作者: stress-response 時間: 2025-3-29 01:02 作者: artifice 時間: 2025-3-29 05:10
Indexing and Searching XML Documents Based on Content and Structure SynopsesOur search query language is XPath extended with full-text search. We introduce two novel data synopsis structures that correlate textual with positional information in an XML document and improves query precision. In addition, we present a two-phase containment filtering algorithm based on these sy作者: 騙子 時間: 2025-3-29 09:44 作者: Initiative 時間: 2025-3-29 14:38 作者: Aviary 時間: 2025-3-29 17:19
Evaluating XPath Queries on XML Data Streamsd to the document - DOM based approaches that have to load and store large parts of the document in main memory will fail. In comparison, we pre sent an approach to evaluate XPath queries on SAX streams that supports all axes of core XPath, including the sibling axes. Starting from the XPath query, 作者: Aviary 時間: 2025-3-29 23:20
PSMQ: Path Based Storage and Metadata Guided Twig Query Evaluationong path expressions, join techniques are not efficient as they increase the number of joins and disk I/O cost. Path based techniques try to reduce the number of joins. In this paper, we propose a metadata guided query evaluation technique which uses path based storage. We use interval encoding for 作者: savage 時間: 2025-3-30 03:05 作者: 無聊點好 時間: 2025-3-30 06:40
Specifying and Optimising XML ViewsXML performs poorly when queried in its native format, and local and global views are not supported by current XML products. In this paper, we support the concept of data everywhere by providing a view mechanism for XML together with a highly-optimised query processing strategy.作者: Altitude 時間: 2025-3-30 10:12
Isolating Order Semantics in Order-Sensitive XQuery-to-SQL Translationcomplex nested XQuery expressions. The order semantics may impede efficient query rewriting for nested query blocks. We propose a general order-sensitive XQuery processing approach involving three steps. First an algorithm is proposed for inferencing about and then isolating the order semantics in X作者: enchant 時間: 2025-3-30 14:22 作者: 召集 時間: 2025-3-30 20:10
Hopfilter: An Agent for Filtering Web Pages Based on the Hopfield Artificial Neural Network Model of developing new advanced tools to collect and filter information that meets users’ preferences. This paper presents an agent that uses automatic indexing, concept space generation, and a Hopfield artificial neural network to filter web pages according to users’ interests. The experiments that wer作者: Recess 時間: 2025-3-31 00:26
A New Approach to Connecting Information Systems in Healthcarelly, healthcare information systems have been disease focused, containing patient data related only to a specific function or concern, such as laboratory results or a particular disease. As healthcare is moving toward a collaborative, patient-centric approach which involves care teams comprising a r作者: falsehood 時間: 2025-3-31 04:00 作者: Ischemia 時間: 2025-3-31 05:27
An Efficient Sheet Partition Technique for Very Large Relational Tables in OLAPral, spreadsheets provide grid-like graphical interfaces together with various chart tools [4,5]. However, previous work on OLAP spreadsheets adopts a naive approach that directly retrieves, transmits, and presents all the resulting data at once. Thus, it is difficult to use the previous work for ve作者: Magnitude 時間: 2025-3-31 09:31 作者: 犬儒主義者 時間: 2025-3-31 15:43 作者: 眨眼 時間: 2025-3-31 17:37
Frank H. P. Fitzek,Marcos D. Katzikely to have the postfix sharing. Therefore, in this paper, we propose a bottom up filtering approach exploiting postfix sharing against the top down approach of YFilter exploiting prefix sharing. Some experimental results show that our method has better performance in the postfix-shared scenario.作者: PRE 時間: 2025-4-1 00:06 作者: 增減字母法 時間: 2025-4-1 04:47 作者: 確定無疑 時間: 2025-4-1 06:10 作者: 除草劑 時間: 2025-4-1 13:27
PosFilter: An Efficient Filtering Technique of XML Documents Based on Postfix Sharingikely to have the postfix sharing. Therefore, in this paper, we propose a bottom up filtering approach exploiting postfix sharing against the top down approach of YFilter exploiting prefix sharing. Some experimental results show that our method has better performance in the postfix-shared scenario.作者: 牛馬之尿 時間: 2025-4-1 17:51
Isolating Order Semantics in Order-Sensitive XQuery-to-SQL Translationical plan into SQL now correctly incorporates the order context annotations to assure the original order semantics. Our experiments illustrate the performance gains achievable by our order handling strategy.作者: 采納 時間: 2025-4-1 22:01
Conference proceedings 2007rchch- lenges have evolved, so BNCOD has changed its topics of interest accordingly, now covering data management more widely. In doing so, it has evolved from a local conference mostly attended by British researchers to a truly international conference that happens to be held in Britain. This year,作者: novelty 時間: 2025-4-1 22:42
Exhaustive Peptide Searching Using Relationshen fetched and stored in a relation. We measure execution time and compare the matches found to those delivered by BLAST. We report some performance gains in exact matching and searching within edit distance 1, and very significant quality improvements over heuristics, as we guarantee to deliver all relevant matches.
