標(biāo)題: Titlebook: Database and Expert Systems Applications; 17th International C Stéphane Bressan,Josef Küng,Roland Wagner Conference proceedings 2006 Spring [打印本頁(yè)] 作者: bankrupt 時(shí)間: 2025-3-21 17:03
書目名稱Database and Expert Systems Applications影響因子(影響力)
書目名稱Database and Expert Systems Applications影響因子(影響力)學(xué)科排名
書目名稱Database and Expert Systems Applications網(wǎng)絡(luò)公開度
書目名稱Database and Expert Systems Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Database and Expert Systems Applications被引頻次
書目名稱Database and Expert Systems Applications被引頻次學(xué)科排名
書目名稱Database and Expert Systems Applications年度引用
書目名稱Database and Expert Systems Applications年度引用學(xué)科排名
書目名稱Database and Expert Systems Applications讀者反饋
書目名稱Database and Expert Systems Applications讀者反饋學(xué)科排名
作者: MOT 時(shí)間: 2025-3-21 21:37 作者: interrogate 時(shí)間: 2025-3-22 02:02 作者: PHONE 時(shí)間: 2025-3-22 08:04
,: Building e-Science Data Integration Toolssources. Transparent access is achieved by a global view that expresses the requirements of a community of users (i.e., astronomers) and data integration mechanisms adapted to astronomical data characteristics. Instead of providing an ad hoc mediator, . can be configured for giving access to differe作者: 支柱 時(shí)間: 2025-3-22 11:46 作者: 貪婪性 時(shí)間: 2025-3-22 12:54 作者: 貪婪性 時(shí)間: 2025-3-22 18:50
Using an Oracle Repository to Accelerate XPath Queries community, solutions are either partial (not providing full XPath functionality) or unable to manage database updates. In this work, we exploit features of Oracle 10g in order to rapidly build indexes that improve the processing times of XML databases. Significantly, we can also support XML databas作者: Customary 時(shí)間: 2025-3-22 21:12 作者: 變色龍 時(shí)間: 2025-3-23 03:27
A Prototype of a Schema-Based XPath Satisfiability Testerthe satisfiability test before executing a query can save evaluation time and transportation costs in distributed scenarios. Therefore, we propose a schema-based approach to the satisfiability test of XPath queries, which checks whether or not an XPath query conforms to the constraints in a given sc作者: 糾纏 時(shí)間: 2025-3-23 07:42 作者: B-cell 時(shí)間: 2025-3-23 11:03 作者: 提升 時(shí)間: 2025-3-23 15:59 作者: 瘙癢 時(shí)間: 2025-3-23 18:38
Rewriting Queries for XML Integration Systems A user poses a query over the target schema, and the system rewrites the query into a set of queries over the data sources. Existing algorithms generate a set of static rules based on the target schema and mappings, and rewrite the target query using these rules. We design a flexible and dynamic ap作者: 注射器 時(shí)間: 2025-3-23 23:49 作者: 做作 時(shí)間: 2025-3-24 04:04
Visual Specification and Optimization of XQuery Using VXQbecoming a standard for querying such systems. However, the complexity of XQuery prevents its usage by broad audience. This paper proposes a visual XQuery specification language called VXQ to address this issue. By intuitive abstractions of XML and XQuery, the proposed system can generate XQueries f作者: circuit 時(shí)間: 2025-3-24 06:41 作者: 天真 時(shí)間: 2025-3-24 10:46 作者: monopoly 時(shí)間: 2025-3-24 17:39
Evaluation of a Probabilistic Approach to Classify Incomplete Objects Using Decision Treesod, proposed by Lobo and Numao in 2000, which builds a decision tree for each attribute and uses these trees to fill the missing attribute values. Both our approach and theirs are based on the Mutual Information between the attributes and the class. Our method takes the dependence between attributes作者: 細(xì)頸瓶 時(shí)間: 2025-3-24 20:19 作者: Blasphemy 時(shí)間: 2025-3-25 01:35 作者: Gene408 時(shí)間: 2025-3-25 05:00
Contrastive Analysis in Languageheoretical analysis, we proposed a novel algorithm to guide the implementation of the folding-in method. Our method was justified and evaluated by a series of experiments on various classical IR data sets. The results indicated that our method was effective and had consistent performance over differ作者: PLE 時(shí)間: 2025-3-25 09:10 作者: 流眼淚 時(shí)間: 2025-3-25 14:29
0302-9743 th DEXA. The whole forms a unique international event with a balanced depth and breadth of topics. Its much-appreciated conviviality fosters unmatched opportuni978-3-540-37871-6978-3-540-37872-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 評(píng)論者 時(shí)間: 2025-3-25 16:52
Improving Web Retrieval Precision Based on Semantic Relationships and Proximity of Query Keywordse combined rank. We built a prototype user interface in which the user can dynamically change the weights on two different ranks. The result of the experiment showed that our method improves the precision of Web search results for two-keyword queries.作者: PANT 時(shí)間: 2025-3-25 21:00 作者: 反話 時(shí)間: 2025-3-26 00:17
Understanding and Enhancing the Folding-In Method in Latent Semantic Indexingheoretical analysis, we proposed a novel algorithm to guide the implementation of the folding-in method. Our method was justified and evaluated by a series of experiments on various classical IR data sets. The results indicated that our method was effective and had consistent performance over differ作者: penance 時(shí)間: 2025-3-26 07:25
Analysis of BPEL and High-Level Web Service Orchestration: Bringing Benefits to the Problems of the orchestration. A custom software tool for developing SOA strategies via BPEL and Web service orchestration is outlined towards the end of the paper. Based on an established modelling tool, the SOA add-in is capable of producing complex SOA strategies for a company’s IT department. This tool is pitch作者: CIS 時(shí)間: 2025-3-26 10:17 作者: 農(nóng)學(xué) 時(shí)間: 2025-3-26 14:20 作者: phase-2-enzyme 時(shí)間: 2025-3-26 18:03 作者: Longitude 時(shí)間: 2025-3-26 22:09
Alexander N. Sencha,Ella I. PeniaevaThis paper focuses on relevance scoring for XML IR queries. We propose a novel and effective algorithm for relevance scoring, which considers both structural information and semantic. Experiments show that the algorithm can effectively improve the Precision and Recall for XML information retrieval.作者: 狂熱語(yǔ)言 時(shí)間: 2025-3-27 01:08 作者: phlegm 時(shí)間: 2025-3-27 09:18 作者: parasite 時(shí)間: 2025-3-27 10:29
Alexander N. Sencha,Yury N. Patrunovo previous approaches that shred the entire . document into a newly created database of a newly designed schema. The framework is based on a notion of . mappings. An . mapping extends a (.) . by associating element types with semantic attributes and rules. It extracts either part or all of the data 作者: 要素 時(shí)間: 2025-3-27 15:02 作者: opalescence 時(shí)間: 2025-3-27 20:36 作者: 尖叫 時(shí)間: 2025-3-28 01:09 作者: Obliterate 時(shí)間: 2025-3-28 05:53
https://doi.org/10.1007/978-1-349-12602-6ed to solve a very old and, at the same time, very well-known problem: how to produce software of quality. Programming has been the key task during the last 40 years, and the results have not been successful yet. This work will explore the need of facing a sound software production process from a di作者: Concrete 時(shí)間: 2025-3-28 08:00
A Semantic Map for Imperative-Hortatives community, solutions are either partial (not providing full XPath functionality) or unable to manage database updates. In this work, we exploit features of Oracle 10g in order to rapidly build indexes that improve the processing times of XML databases. Significantly, we can also support XML databas作者: Oversee 時(shí)間: 2025-3-28 10:59 作者: 熱情贊揚(yáng) 時(shí)間: 2025-3-28 15:45 作者: FLUSH 時(shí)間: 2025-3-28 20:49
Contrastive Analysis in Languagebased text retrieval. However, in many real-world applications dealing with very large document collections, LSI suffers from its high computational complexity, which comes from the process of Singular Value Decomposition(SVD). As a result, in practice, the folding-in method is widely used as an app作者: seroma 時(shí)間: 2025-3-29 00:40 作者: compose 時(shí)間: 2025-3-29 05:33 作者: flaggy 時(shí)間: 2025-3-29 08:10
Michaela Martinková,Markéta Janebová A user poses a query over the target schema, and the system rewrites the query into a set of queries over the data sources. Existing algorithms generate a set of static rules based on the target schema and mappings, and rewrite the target query using these rules. We design a flexible and dynamic ap作者: ciliary-body 時(shí)間: 2025-3-29 11:34
Chungmin Lee,Ferenc Kiefer,Manfred Krifkathan . techniques as far as query performance is concerned. This paper studies three strategies for storing XML document including one representing schema-conscious approach (.) and two representing schema-oblivious approach (XParent and .). We implement and evaluate each approach using benchmark . 作者: 不法行為 時(shí)間: 2025-3-29 17:00 作者: Femine 時(shí)間: 2025-3-29 20:03 作者: 被告 時(shí)間: 2025-3-30 00:52 作者: Intend 時(shí)間: 2025-3-30 06:12 作者: 鐵砧 時(shí)間: 2025-3-30 09:38
https://doi.org/10.1007/11827405Extensible Markup Language (XML); Workflow; automation; bioinformatics; data mining; data warehouse; datab作者: emulsify 時(shí)間: 2025-3-30 14:32 作者: Palpable 時(shí)間: 2025-3-30 18:44
Efficient Processing of Multiple XML Twig Querieshich is specially tailored to match documents with large numbers of twig pattern queries. We introduce the . to represent multiple twig queries. Based on the ., we design a holistic twig join algorithm, called ., to find all matches for multiple twig queries by scanning an XML document only once.作者: 放牧 時(shí)間: 2025-3-30 21:23
Selectively Storing XML Data in Relationsfrom an . document, and generates . updates to increment an existing database using the . data. We also provide an efficient technique to evaluate . mappings in parallel with . parsing. These yield a systematic method to store . data selectively in an existing database.作者: 乞討 時(shí)間: 2025-3-31 03:53 作者: immunity 時(shí)間: 2025-3-31 05:00 作者: 無(wú)法破譯 時(shí)間: 2025-3-31 12:10
Visual Specification and Optimization of XQuery Using VXQor users that have little knowledge about the language. We show that our visual language is more expressive than previous proposals. Finally, we extend our proposed visual XQuery to support query rewriting and optimization for multiple XQuery systems.作者: Interstellar 時(shí)間: 2025-3-31 14:55 作者: 留戀 時(shí)間: 2025-3-31 18:41 作者: 清楚 時(shí)間: 2025-3-31 22:21
Ekaterina A. Sencha,Alexander N. Senchahich is specially tailored to match documents with large numbers of twig pattern queries. We introduce the . to represent multiple twig queries. Based on the ., we design a holistic twig join algorithm, called ., to find all matches for multiple twig queries by scanning an XML document only once.作者: Synovial-Fluid 時(shí)間: 2025-4-1 03:07 作者: Canyon 時(shí)間: 2025-4-1 07:11 作者: 重疊 時(shí)間: 2025-4-1 12:23 作者: 植物學(xué) 時(shí)間: 2025-4-1 16:17
