標題: Titlebook: Database and Expert Systems Applications; 23rd International C Stephen W. Liddle,Klaus-Dieter Schewe,Xiaofang Zho Conference proceedings 20 [打印本頁] 作者: Adentitious 時間: 2025-3-21 19:06
書目名稱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é)科排名
作者: ADJ 時間: 2025-3-21 23:44
A Write Efficient PCM-Aware Sorts low write endurance and expensive writes need to be addressed. In this paper, we propose PCM-aware sorting algorithms that can mitigate writes on PCM by efficient use of the small DRAM buffer. Our performance evaluation shows that the proposed schemes can significantly outperform existing schemes that are oblivious of the PCM.作者: penance 時間: 2025-3-22 00:38 作者: 閑逛 時間: 2025-3-22 06:52 作者: Conflagration 時間: 2025-3-22 09:33 作者: 擴張 時間: 2025-3-22 14:51
On Checking Executable Conceptual Schema Validity by Testingnecessary conditions for schema validity (correctness and relevance). The proposed criteria are independent from the languages of the schema and of the testing program. The criteria have been implemented in a prototype of a test processor able to execute test sets. The criteria have been applied to the test sets of large conceptual schemas.作者: 擴張 時間: 2025-3-22 19:17
Kenichi Hori,Makoto Takizawa,Michel Raynalain possible and the validation of the compositions is left to the testing and deployment phases. From the business point of view, customers do not trust these services nor rely on them. As a consequence, building correct, safe and trustable web services compositions becomes a major challenge.作者: 謙卑 時間: 2025-3-22 21:16
https://doi.org/10.1007/978-0-387-35357-9ments respectively. General XML queries involving several twig patterns are processed by the both data structures. We further analyze join order selection for a general query with both pattern matching and value-based join, which is essential for the generation of a good query plan.作者: Acetabulum 時間: 2025-3-23 04:08
H. E. Cook,C. J. Gauthier Professorallest size and therefore reuse all the deleted labels to control the label size increasing speed; meanwhile the algorithms can completely avoid the re-labeling also. Extensive experimental results show that the algorithms proposed in this paper can control the label size increasing speed and enhance the query performance.作者: 消滅 時間: 2025-3-23 05:46
H. E. Cook,C. J. Gauthier Professort both approaches, especially the native one, effectively improve the use of flash memory in the mid-tier cache. NFA reduces the number of garbage collections and block erasures by up to a factor of five and improves the mid-tier throughput by up to 66%.作者: 襲擊 時間: 2025-3-23 13:41 作者: conjunctivitis 時間: 2025-3-23 14:10 作者: 命令變成大炮 時間: 2025-3-23 18:20 作者: DALLY 時間: 2025-3-23 23:22 作者: RAGE 時間: 2025-3-24 04:11
Stepwise Development of Formal Models for Web Services Compositions: Modelling and Property Verificaain possible and the validation of the compositions is left to the testing and deployment phases. From the business point of view, customers do not trust these services nor rely on them. As a consequence, building correct, safe and trustable web services compositions becomes a major challenge.作者: myriad 時間: 2025-3-24 06:39
A Hybrid Approach for General XML Query Processingments respectively. General XML queries involving several twig patterns are processed by the both data structures. We further analyze join order selection for a general query with both pattern matching and value-based join, which is essential for the generation of a good query plan.作者: exigent 時間: 2025-3-24 14:41 作者: Psa617 時間: 2025-3-24 15:26 作者: 損壞 時間: 2025-3-24 20:08
Automated Extraction of Semantic Concepts from Semi-structured Data: Supporting Computer-Based Educahniques to extract concepts and relationships to produce the knowledge representation. We evaluate this approach by comparing the machine-generated vocabularies to terms rated by domain experts, and show a measurable improvement over existing techniques.作者: archetype 時間: 2025-3-25 00:04
A Confidence–Weighted Metric for Unsupervised Ontology Population from Web Textsetrieved by the system. We conducted preliminary experiments comparing the proposed confidence metric against some versions of the PMI metric. We obtained promising results for the final ranking of the candidate instances, achieving a gain in precision up to 24%.作者: Leisureliness 時間: 2025-3-25 05:31
The Effective Relevance Link between a Document and a Query should be more taken into consideration when setting up an Information Retrieval (IR) Model or System. Finally, our work shows that taking into account this effective link in a more explicit and direct way into existing IR models does improve their retrieval performance.作者: SHOCK 時間: 2025-3-25 08:49 作者: 來自于 時間: 2025-3-25 13:20
https://doi.org/10.1007/978-0-387-35357-9pletely avoid relabeling existing labels. In particular, SCOOTER can handle frequently skewed insertions gracefully. Theoretical analysis and experimental results confirm the scalability, compact representation, efficient growth rate and performance of SCOOTER in comparison to existing dynamic labeling schemes.作者: endocardium 時間: 2025-3-25 19:42 作者: 補角 時間: 2025-3-25 20:37 作者: Femish 時間: 2025-3-26 02:33 作者: cringe 時間: 2025-3-26 05:04
Finding Top-K Correct XPath Queries of User’s Incorrect XPath Querye integer ., ”top-.” XPath queries ”most similar” to . among the XPath queries conforming to . so that a user select an appropriate query among the . queries. We also present some experimental studies.作者: Spinal-Fusion 時間: 2025-3-26 09:04
Spreadsheet Metadata Extraction: A Layout-Based Approachore, the extracted metadata is semantically classified and hierarchically grouped in order to allow end-users to define complex search queries and the meanings of search keywords. System implementation of the proposed method is also discussed.作者: Ingredient 時間: 2025-3-26 13:31 作者: 搬運工 時間: 2025-3-26 17:11 作者: 取之不竭 時間: 2025-3-26 23:31 作者: Pseudoephedrine 時間: 2025-3-27 02:08 作者: PARA 時間: 2025-3-27 08:03 作者: MANIA 時間: 2025-3-27 09:56
Towards an Efficient Flash-Based Mid-Tier Cachee system. However, previous studies related to flash-based mid-tier caching only considered the indirect use of flash memory via a flash translation layer, which causes expensive flash-based cache maintenance. This paper identifies the weaknesses of such indirect methods, with a focus on the . probl作者: 溝通 時間: 2025-3-27 16:07 作者: Commonplace 時間: 2025-3-27 18:59
A Write Efficient PCM-Aware Sortch systems typically have a small DRAM buffer as a part of the main memory. However, for these systems to be widely adopted, limitations of PCM such as low write endurance and expensive writes need to be addressed. In this paper, we propose PCM-aware sorting algorithms that can mitigate writes on PC作者: musicologist 時間: 2025-3-28 00:26
Performance Analysis of Algorithms to Reason about XML Keysoposed over the last decade, and their expressiveness and computational properties have been analyzed in theory. In practice, however, expressive notions of XML keys with good reasoning capabilities have been widely ignored. In this paper we present an efficient implementation of an algorithm that d作者: 曲解 時間: 2025-3-28 02:28 作者: 雪白 時間: 2025-3-28 06:16
Analyzing Plan Diagrams of XQuery Optimizers and powerful query operators, including regular expressions and sibling axes, renders the query optimization challenge significantly more complex. In this paper, we analyze the behavior of industrial-strength XQuery optimizers using the notion of “plan diagrams”, which had hitherto been applied sol作者: 抗原 時間: 2025-3-28 11:27 作者: 使服水土 時間: 2025-3-28 17:02
Automated Extraction of Semantic Concepts from Semi-structured Data: Supporting Computer-Based Educaystems provide automated questions, answers, feedback, and the recommendation of further resources. The most difficult task in intelligent system formation is the modelling of domain knowledge, which is traditionally undertaken manually or semi-automatically by knowledge engineers and domain experts作者: 乳汁 時間: 2025-3-28 20:17 作者: gustation 時間: 2025-3-29 01:07 作者: Intercept 時間: 2025-3-29 03:12
The Effective Relevance Link between a Document and a Querye reason why a document is relevant to a query that we called the Effective Relevance Link, and second the valuation of this link, known as the Relevance Status Value (RSV). We present a formal definition of this semantic link between . and .. In addition, we clarify how an existing IR model, like V作者: Intruder 時間: 2025-3-29 08:35
Incremental Computation of Skyline Queries with Dynamic Preferenceslevant data corresponding to multiple criteria provided by users remains a difficult task, especially when the data are large. In 2008-2009, Wong et al. showed how to avoid costly skyline query computations by deriving the skyline points associated with any preference from the skyline points associa作者: 松緊帶 時間: 2025-3-29 12:56 作者: 重畫只能放棄 時間: 2025-3-29 16:00 作者: 易受刺激 時間: 2025-3-29 22:23
0302-9743 ilure, fault analysis, and uncertainty; predication, extraction, and annotation; ranking and personalisation; database partitioning and performance measurement; recommendation and prediction systems; business processes; social networking.978-3-642-32599-1978-3-642-32600-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Stable-Angina 時間: 2025-3-30 01:16
Conference proceedings 2012 query answering; structuring, compression and optimization; failure, fault analysis, and uncertainty; predication, extraction, and annotation; ranking and personalisation; database partitioning and performance measurement; recommendation and prediction systems; business processes; social networking.作者: Cardioplegia 時間: 2025-3-30 05:15 作者: 免除責任 時間: 2025-3-30 08:53
https://doi.org/10.1007/978-1-4615-2790-9t points and the exits created by ladders are referred as “dynamic exits”. Next, we propose a heuristic for placing a given number of ladders at dynamic exit points based on the distribution of evacuees in the building. We extend the existing capacity constrained route planner (CCRP) algorithm for d作者: Infusion 時間: 2025-3-30 14:00 作者: 歡呼 時間: 2025-3-30 20:03 作者: 健談的人 時間: 2025-3-31 00:06 作者: 比喻好 時間: 2025-3-31 04:00 作者: Jejune 時間: 2025-3-31 06:31
DIADEM: Domains to Databasestity recognition together with advances in ontology reasoning have made possible a new generation of knowledgedriven, domain-specific data extraction approaches. To that end, we introduce ., the first automated data extraction system that can turn nearly any website of a domain into structured data,作者: FER 時間: 2025-3-31 10:25 作者: 合同 時間: 2025-3-31 16:16 作者: Panther 時間: 2025-3-31 20:56
Analyzing Plan Diagrams of XQuery Optimizersher, they are more resistant to “anorexic reduction”, requiring substantially larger cost-increase thresholds to achieve this objective. These results suggest that important research challenges remain to be addressed in the development of effective XQuery optimizers.作者: Emmenagogue 時間: 2025-3-31 22:58 作者: COST 時間: 2025-4-1 03:23 作者: infringe 時間: 2025-4-1 08:43
Kenichi Hori,Makoto Takizawa,Michel Raynal restaurants’ menus automatically collected from hundreds or thousands of agencies, travel agencies, or restaurants, presented as a single homogeneous dataset..Historically, this has required tremendous effort by the data providers and whoever is collecting the data: Vertical search engines aggregat作者: 粗鄙的人 時間: 2025-4-1 13:52
Kenichi Hori,Makoto Takizawa,Michel Raynal domains like concurrent engineering, semantic web, system engineering or electronic commerce. Moreover, due to the ease of use of the web, the idea of composing these web services to build composite ones defining complex workflows arose. Even if several industrial standards providing specification 作者: 不近人情 時間: 2025-4-1 14:48
https://doi.org/10.1007/978-0-387-35357-9es are modeled by multiple twig patterns with joins to link them. The output of twig pattern matching is tuples of labels, while the joins between twig patterns are based on values. The inefficiency of integrating label-based structural joins in twig pattern matching and value-based joins to link pa作者: 擁護者 時間: 2025-4-1 18:40 作者: HEW 時間: 2025-4-1 23:30
