標(biāo)題: Titlebook: Database Systems for Advanced Applications; 10th International C Lizhu Zhou,Beng Chin Ooi,Xiaofeng Meng Conference proceedings 2005 Springe [打印本頁] 作者: Motion 時(shí)間: 2025-3-21 16:54
書目名稱Database Systems for Advanced Applications影響因子(影響力)
書目名稱Database Systems for Advanced Applications影響因子(影響力)學(xué)科排名
書目名稱Database Systems for Advanced Applications網(wǎng)絡(luò)公開度
書目名稱Database Systems for Advanced Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Database Systems for Advanced Applications被引頻次
書目名稱Database Systems for Advanced Applications被引頻次學(xué)科排名
書目名稱Database Systems for Advanced Applications年度引用
書目名稱Database Systems for Advanced Applications年度引用學(xué)科排名
書目名稱Database Systems for Advanced Applications讀者反饋
書目名稱Database Systems for Advanced Applications讀者反饋學(xué)科排名
作者: gospel 時(shí)間: 2025-3-21 23:14 作者: cliche 時(shí)間: 2025-3-22 01:07
Complex Networks and Network Data Mining effect of a node is denoted with its computable quality, such as the city scale with traffic network, the node throughput of communication network, the hit rates of a web site, and the individual prestige of human relationship. By this method, the interaction between nodes is denoted by the distanc作者: 協(xié)奏曲 時(shí)間: 2025-3-22 08:14 作者: CREEK 時(shí)間: 2025-3-22 11:54
PADS: Protein Structure Alignment Using Directional Shape Signaturesnt by .irectional shape .ignatures) incorporates the three dimensional coordinates of the main atoms of each amino acid and extracts a geometrical shape signature along with the direction of each amino acid. As a result, each protein structure is presented by a series of multidimensional feature vec作者: heckle 時(shí)間: 2025-3-22 13:25
LinkageTracker: A Discriminative Pattern Tracking Approach to Linkage Disequilibrium Mappingnd normal controls. In reality, the presence of disease-associated chromosomes in affected population is relatively low (usually 10% or less). Hence, it is a challenge to locate these disease genes on the chromosomes. In this paper, we propose an algorithm known as LinkageTracker for linkage disequi作者: heckle 時(shí)間: 2025-3-22 17:30
Query Optimization in Encrypted Database Systems encrypted data. However, the problem of how to put these techniques together in an optimum manner was not addressed, which is equivalent to having an RDBMS without a query optimizer. This paper models and solves that optimization problem.作者: 引起痛苦 時(shí)間: 2025-3-22 22:54 作者: Semblance 時(shí)間: 2025-3-23 02:42
Effective Approaches for Watermarking XML Data the known effective watermarking schemes to XML data, since noisy data may not be acceptable due to its structures and node extents. In this paper, we present two different watermarking schemes on XML data: the selective approach and the compression approach. The former allows us to embed non-destr作者: 天然熱噴泉 時(shí)間: 2025-3-23 07:09
A Unifying Framework for Merging and Evaluating XML Informationcooperative manner, such as developing an XML mediator schema or using eXtensible Stylesheet Language Transformation (XSLT). However, it is not trivial to evaluate the quality of such merged XML data, even when we have the knowledge of the involved XML data sources. Herein, we present a unifying fra作者: 喃喃訴苦 時(shí)間: 2025-3-23 10:41
Efficient Evaluation of Partial Match Queries for XML Documents Using Information Retrieval Techniquial match query is defined as the one having the descendent-or-self axis “//” in its path expression. In its general form, a partial match query has branch predicates forming branching paths. The objective of XIR is to efficiently support this type of queries for large-scale documents of heterogeneo作者: 沉默 時(shí)間: 2025-3-23 15:48 作者: 拱形大橋 時(shí)間: 2025-3-23 21:55
An Improved Prefix Labeling Scheme: A Binary String Approach for Dynamic Ordered XMLdes can be determined quickly. Another important feature of XML is that the elements in XML are intrinsically ordered. However the label update cost is high based on the present labeling schemes. They have to re-label the existing nodes or re-calculate some values when inserting an order-sensitive e作者: Psychogenic 時(shí)間: 2025-3-24 01:24
Efficiently Coding and Indexing XML Documentficiently support all kinds of queries. A compact index structure, named HiD, is also proposed in this paper. Query algorithms based this index structure are introduced. At last, the comprehensive experiments are conducted to assess all the technologies in question.作者: Immortal 時(shí)間: 2025-3-24 04:40
XQuery-Based TV-Anytime Metadata Management-based browsing, non-linear navigation, usage of user preference, and history, etc. On the other hand, one of the important factors for this new broadcasting environment is the interoperability among providers and consumers since the environment is distributed. Therefore a standard metadata for digi作者: 依法逮捕 時(shí)間: 2025-3-24 07:42 作者: 業(yè)余愛好者 時(shí)間: 2025-3-24 12:01 作者: phase-2-enzyme 時(shí)間: 2025-3-24 15:01 作者: airborne 時(shí)間: 2025-3-24 20:26
Real Datasets for File-Sharing Peer-to-Peer Systemsbility. As a result, a significant amount of research work has focused on designing efficient search protocols that reduce the overall communication cost. What is lacking, however, is the availability of real data, regarding the exact content of users’ libraries and the queries that these users ask.作者: landmark 時(shí)間: 2025-3-24 23:27
PCASSO: Vanguard in Patient Empowermentdata which is unrealistic for stream data. More importantly, the characteristics of the data stream can change over time and the evolving pattern needs to be captured. Furthermore, we need to consider the problem of resource allocation in mining data streams. Due to the large volume and the high spe作者: 壓迫 時(shí)間: 2025-3-25 05:47
Bonnie J. Wakefield,Michael G. Kienzlement specifies the intended use of the data element. Purpose information represents an important form of metadata, because data usage purpose is very often part of privacy policies, such as the case of policies expressed according to P3P. A key feature of our model is that it allows multiple purpose作者: 豎琴 時(shí)間: 2025-3-25 10:34
Loretta Schlachta-Fairchild,Victoria Elfrinkd simulate the optimization of web mining to form a mining engine by excluding those redundant and irrelevant nodes. The method can lead to the reduction of complicated messy web site structures to a new informative concise graph. In a prototype system for mining informative structure, several exper作者: 優(yōu)雅 時(shí)間: 2025-3-25 14:38 作者: 獸群 時(shí)間: 2025-3-25 17:32 作者: FADE 時(shí)間: 2025-3-25 20:07
https://doi.org/10.1007/978-3-319-55624-6especially using XQuery as a query language. Since the volume of metadata would be very large in real situation, our system considers a relational database system as storage. We implement a prototype system and test performance for various typical queries by comparing our system with other general-p作者: 使隔離 時(shí)間: 2025-3-26 01:13 作者: 鉤針織物 時(shí)間: 2025-3-26 05:15
Louise Ellen Teitz,David P. Stewartly reducing the size of the representation of all minimal generators, similar to the way that closed itemsets are useful for losslessly reducing the size of the representation of all frequent itemsets. The removal of redudancies will help human users to grasp the structure and information in the con作者: Delude 時(shí)間: 2025-3-26 12:24
Consumer Policy from Below: An Introduction,ormation about the nodes (e.g., connection speed). We also collected the queries initiated by these users. After filtering, the data were organized in XML format and are available to researchers. Here, we analyze this dataset and present its statistical characteristics. Additionally, as a case study作者: incite 時(shí)間: 2025-3-26 15:55
Data Stream Mining and Resource Adaptive Computationdata which is unrealistic for stream data. More importantly, the characteristics of the data stream can change over time and the evolving pattern needs to be captured. Furthermore, we need to consider the problem of resource allocation in mining data streams. Due to the large volume and the high spe作者: PACK 時(shí)間: 2025-3-26 20:36 作者: 廣告 時(shí)間: 2025-3-27 00:38
Complex Networks and Network Data Miningd simulate the optimization of web mining to form a mining engine by excluding those redundant and irrelevant nodes. The method can lead to the reduction of complicated messy web site structures to a new informative concise graph. In a prototype system for mining informative structure, several exper作者: Measured 時(shí)間: 2025-3-27 04:33
PADS: Protein Structure Alignment Using Directional Shape Signaturese results. The proposed algorithm is fast and accurate and hence could be used for analysis and knowledge discovery in large protein structures. The method has been compared with the results from CE, DALI, and CTSS using a representative sample of PDB structures. Several new structures not detected 作者: 熒光 時(shí)間: 2025-3-27 08:23
Efficient Evaluation of Partial Match Queries for XML Documents Using Information Retrieval Techniqu expressions, and allows for finding the result nodes more efficiently than containment joins used in the conventional methods. We compare the efficiency of XIR with those of XRel and XParent using XML documents crawled from the Internet. The results show that XIR is more efficient than both XRel an作者: surmount 時(shí)間: 2025-3-27 10:09
XQuery-Based TV-Anytime Metadata Managementespecially using XQuery as a query language. Since the volume of metadata would be very large in real situation, our system considers a relational database system as storage. We implement a prototype system and test performance for various typical queries by comparing our system with other general-p作者: 爭吵加 時(shí)間: 2025-3-27 17:37 作者: Acclaim 時(shí)間: 2025-3-27 21:11
Mining Succinct Systems of Minimal Generators of Formal Conceptsly reducing the size of the representation of all minimal generators, similar to the way that closed itemsets are useful for losslessly reducing the size of the representation of all frequent itemsets. The removal of redudancies will help human users to grasp the structure and information in the con作者: MILL 時(shí)間: 2025-3-28 01:53
Real Datasets for File-Sharing Peer-to-Peer Systemsormation about the nodes (e.g., connection speed). We also collected the queries initiated by these users. After filtering, the data were organized in XML format and are available to researchers. Here, we analyze this dataset and present its statistical characteristics. Additionally, as a case study作者: palette 時(shí)間: 2025-3-28 05:58 作者: 財(cái)主 時(shí)間: 2025-3-28 07:54 作者: GULF 時(shí)間: 2025-3-28 11:46 作者: Enthralling 時(shí)間: 2025-3-28 18:22 作者: insert 時(shí)間: 2025-3-28 20:04
Ellen Beckjord,David K. Ahern,Bradford Hessent by .irectional shape .ignatures) incorporates the three dimensional coordinates of the main atoms of each amino acid and extracts a geometrical shape signature along with the direction of each amino acid. As a result, each protein structure is presented by a series of multidimensional feature vec作者: 鈍劍 時(shí)間: 2025-3-28 23:14
Consumer Informatics and Digital Healthnd normal controls. In reality, the presence of disease-associated chromosomes in affected population is relatively low (usually 10% or less). Hence, it is a challenge to locate these disease genes on the chromosomes. In this paper, we propose an algorithm known as LinkageTracker for linkage disequi作者: 有害處 時(shí)間: 2025-3-29 05:49
Ellen Beckjord,David K. Ahern,Bradford Hesse encrypted data. However, the problem of how to put these techniques together in an optimum manner was not addressed, which is equivalent to having an RDBMS without a query optimizer. This paper models and solves that optimization problem.作者: 摻和 時(shí)間: 2025-3-29 09:11
International Series on Consumer Sciencee problem of watermarking spatial trajectory database. The formal definition of the problem is given and the potential attacks are analyzed. Then a novel watermarking method is proposed, which embed the watermark information by introducing a small error to the trajectory shape rather than certain da作者: opportune 時(shí)間: 2025-3-29 13:01 作者: diskitis 時(shí)間: 2025-3-29 16:19 作者: Thymus 時(shí)間: 2025-3-29 21:17
Mariusz J. Golecki,Piotr Tereszkiewiczial match query is defined as the one having the descendent-or-self axis “//” in its path expression. In its general form, a partial match query has branch predicates forming branching paths. The objective of XIR is to efficiently support this type of queries for large-scale documents of heterogeneo作者: 開頭 時(shí)間: 2025-3-30 01:19
Fabrizio Esposito,Anne-Lise Sibony works have examined the processing of more complex queries that contain not-predicates. In this paper, we present the first study on evaluating path queries with not-predicates. We propose an efficient holistic path join algorithm, PathStack., which has the following advantages: (1) it requires onl作者: 青春期 時(shí)間: 2025-3-30 08:07 作者: 沉積物 時(shí)間: 2025-3-30 11:08 作者: macular-edema 時(shí)間: 2025-3-30 15:34
https://doi.org/10.1007/978-3-319-55624-6-based browsing, non-linear navigation, usage of user preference, and history, etc. On the other hand, one of the important factors for this new broadcasting environment is the interoperability among providers and consumers since the environment is distributed. Therefore a standard metadata for digi作者: ODIUM 時(shí)間: 2025-3-30 17:21 作者: 意見一致 時(shí)間: 2025-3-30 21:30 作者: narcissism 時(shí)間: 2025-3-31 03:54
Consumer Policy from Below: An Introduction,sed clustering often returns a large number of highly-overlapping clusters, which makes it hard for users to identify interesting patterns from the mining results. Moreover, there lacks of a general model for pattern-based clustering. Different kinds of patterns or different measures on the pattern 作者: 喚醒 時(shí)間: 2025-3-31 05:42
Consumer Policy from Below: An Introduction,bility. As a result, a significant amount of research work has focused on designing efficient search protocols that reduce the overall communication cost. What is lacking, however, is the availability of real data, regarding the exact content of users’ libraries and the queries that these users ask.作者: 披肩 時(shí)間: 2025-3-31 09:59 作者: 臆斷 時(shí)間: 2025-3-31 16:44 作者: visceral-fat 時(shí)間: 2025-3-31 18:05 作者: 別名 時(shí)間: 2025-3-31 23:53
https://doi.org/10.1007/b107189Alignment; DOM; Extensible Markup Language (XML); SQL; XML data processing; architectures; biomedical data
