Titlebook: Database and Expert Systems Applications; 23rd International C Stephen W. Liddle,Klaus-Dieter Schewe,Xiaofang Zho Conference proceedings 20

Adentitious

書目名稱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

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

閑逛

Conflagration

擴(kuò)張

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.

擴(kuò)張

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.

謙卑

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

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.

消滅

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%.