运动吧
发表于 2025-3-28 16:09:03
http://reply.papertrans.cn/16/1502/150181/150181_41.png
obsolete
发表于 2025-3-28 19:42:59
An Effective and Efficient Approach for Keyword-Based XML Retrievalhe target XML document before constructing a query. For a keyword-based search engine for XML document, the key issue is how to return some sets of meaningfully related nodes to user’s query efficiently. An ordinary solution of current approaches is to store the relationship of each pair of nodes in
小木槌
发表于 2025-3-29 02:29:57
Subgraph Join: Efficient Processing Subgraph Queries on Graph-Structured XML Documentmatches the subgraph of graph structured XML document on some given schema. The query processing of graph-structured XML document brings new challenges..In this paper, for the processing of subgraph query, we design a subgraph join algorithm based on reachability coding. Using efficient data structu
特别容易碎
发表于 2025-3-29 05:16:37
http://reply.papertrans.cn/16/1502/150181/150181_44.png
Substance
发表于 2025-3-29 10:18:31
http://reply.papertrans.cn/16/1502/150181/150181_45.png
花束
发表于 2025-3-29 13:43:35
Self-adaptive Statistics Management for Efficient Query Processingtomated Statistics management is an important step towards a self-tuning DBMS and plays a key role in improving the quality of execution plans generated by the optimizer, and hence leads to shorter query processing times. In this paper, we present SASM, a framework for Self-Adaptive Statistics Manag
夹克怕包裹
发表于 2025-3-29 19:28:07
http://reply.papertrans.cn/16/1502/150181/150181_47.png
抓住他投降
发表于 2025-3-29 23:10:42
Importance-Based Web Page Classification Using Cost-Sensitive SVMin content and quality, just as PageRank suggested. Typical machine learning algorithms take advantage of positive and negative examples to train a classifier; however, it has been neglected that each instance has a different weight, which can be user pre-defined. This paper presents an effective al
走调
发表于 2025-3-30 03:49:23
An Efficient Approach for Interactive Mining of Frequent Itemsets interactive circumstances where users often change minimum support threshold (minsup) because the change of minsup may invalidate existing frequent itemsets or introduce new frequent itemsets. In this paper, we propose an efficient interactive mining technique based on a novel vertical itemset tree
kidney
发表于 2025-3-30 04:56:02
Similarity Search with Implicit Object Features object are not pre-computed/evaluated. As the existing similarity search techniques are not applicable, a novel and efficient algorithm is developed in this paper to approach the problem. The R-tree based algorithm consists of two steps: feature evaluation and similarity search. Our performance eva