標(biāo)題: Titlebook: Database Systems for Advanced Applications; 16th International C Jeffrey Xu Yu,Myoung Ho Kim,Rainer Unland Conference proceedings 2011 Spri [打印本頁] 作者: Daguerreotype 時(shí)間: 2025-3-21 17:19
書目名稱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é)科排名
作者: 爭吵加 時(shí)間: 2025-3-21 23:26 作者: grenade 時(shí)間: 2025-3-22 04:18 作者: Amnesty 時(shí)間: 2025-3-22 05:42
The Art Object as a Memory Triggerhe relational database that is implied by the conceptual schema. Such instances may be submitted to people involved in the requirements phase as a glimpse of what instances are allowed by the E-R schema at hand, thus enhancing database comprehension and so-called face validation.作者: Etching 時(shí)間: 2025-3-22 08:54
Generating Preview Instances for the Face Validation of Entity-Relationship Schemata: The Acyclic Cahe relational database that is implied by the conceptual schema. Such instances may be submitted to people involved in the requirements phase as a glimpse of what instances are allowed by the E-R schema at hand, thus enhancing database comprehension and so-called face validation.作者: SEVER 時(shí)間: 2025-3-22 13:06 作者: SEVER 時(shí)間: 2025-3-22 20:18
I. F. Kirichok,Y. A. Zhuk,S. Yu. Krutsms. In CBR, a typical retrieval strategy is realized through similarity knowledge encoded in similarity measures. This strategy is often called similarity-based retrieval (SBR). This paper proposes and validates that association analysis techniques can be used to improve SBR. We propose a retrieval 作者: 小故事 時(shí)間: 2025-3-23 00:16 作者: 變形 時(shí)間: 2025-3-23 02:03
Anatoly T. Fomenko,Vladislav A. Kibkaloeresting problem to search the closest sentence translations from the Web for high-quality translation, which has attracted significant attention recently. However, it is not straightforward to develop an effective approach, as this task heavily depends on the effectiveness of the similarity model w作者: Flawless 時(shí)間: 2025-3-23 07:13
Adaptation in Theatre and Performancemenities such as schools, supermarkets, and hospitals etc. In this paper, we study the problem of finding the most accessible locations among a set of possible sites. The task is converted to a top-. query that returns . points from a set of sites . with the best accessibilities. Two R-tree based al作者: 修正案 時(shí)間: 2025-3-23 12:52 作者: Grating 時(shí)間: 2025-3-23 16:25
https://doi.org/10.1057/978-1-137-59783-0erns dynamically generated from the input sentence query to collect sentence substitutions from the Web on demand. Experimental results show that our method works well and can be used to obtain sentence substitutions for rare sentence queries as well as for popular sentence queries. It is also shown作者: plasma-cells 時(shí)間: 2025-3-23 19:22
Adaptation in Theatre and Performancesystems that provide reliable long-term preservation of digital objects. Most importantly, these systems have to ensure guaranteed availability over a long period of time, as well as integrity and authenticity of the preserved data and their metadata. This means that all kinds of technical problems 作者: condescend 時(shí)間: 2025-3-24 01:34 作者: JECT 時(shí)間: 2025-3-24 06:17
Contemporary Approaches to Outdoor Learningositions of MOs accurately and for the least communication cost is an important goal. To achieve this, MO position prediction is important. Some studies have proposed real-time monitoring systems that share route information between MOs and a server to predict MO position; however, these systems tar作者: transient-pain 時(shí)間: 2025-3-24 06:30 作者: FLEET 時(shí)間: 2025-3-24 14:10
https://doi.org/10.1007/978-3-031-32346-1ints in . with the largest aggregate distances to all points in .. For instance, it is reasonable to build a new hotel where the aggregate distances to all existing hotels are maximized to reduce competition. Our investigation of AkFN queries focuses on three aggregate functions, namely ., . and .. 作者: 神經(jīng) 時(shí)間: 2025-3-24 16:27 作者: Budget 時(shí)間: 2025-3-24 22:51 作者: 謊言 時(shí)間: 2025-3-25 00:59
Palgrave Macmillan Memory Studieslanguages over constraint complex value databases. The tools we use come in the form of collapse results which are well established results in the context of first-order logic. We show that active-generic collapse carries over to second-order logic for structures with o-minimality and any relational作者: menopause 時(shí)間: 2025-3-25 07:05
Palgrave Macmillan Memory Studieson the way the mediator allocates queries. On the other hand, it is well known that a single mediator is a potential scalability and performance bottleneck as well as a single point of failure. Thus, multiple mediators should perform the query allocation process. This task is challenging in large-sc作者: Melanocytes 時(shí)間: 2025-3-25 11:22 作者: Exclaim 時(shí)間: 2025-3-25 13:41
Paolo Mura,Keith Kay Hin Tan,Chun Wei Choya “closer” to the requirements of . can be retrieved as answers. Finding the nearest neighbors of .can be a solution; yet finding the data not . by any other data with respect to ., i.e. the dynamic skyline regarding .can be another solution. A data point . is defined to dynamically dominate another作者: Encapsulate 時(shí)間: 2025-3-25 17:54 作者: PAGAN 時(shí)間: 2025-3-25 21:24 作者: committed 時(shí)間: 2025-3-26 02:45 作者: 左右連貫 時(shí)間: 2025-3-26 05:08 作者: chapel 時(shí)間: 2025-3-26 11:50
Real-Time Monitoring of Moving Objects Using Frequently Used Routesn using a common algorithm. When the position of the MO deviates from the prediction, it sends a message to the server to maintain position synchronization. This paper evaluates the proposed method using real trajectories of cars and shows that the proposed method outperforms the conventional method作者: insurgent 時(shí)間: 2025-3-26 14:14 作者: 即席演說 時(shí)間: 2025-3-26 17:48 作者: tendinitis 時(shí)間: 2025-3-27 00:45 作者: 尾巴 時(shí)間: 2025-3-27 01:23
Once Upon a Time in Performance Artspace in two levels, where the first level represents the list of occurring states for each individual dimension, and the second level represents the list of occurring images for each state. In the query process, candidates can be quickly identified with a simple weighted state-voting scheme before 作者: nonsensical 時(shí)間: 2025-3-27 06:24 作者: 榨取 時(shí)間: 2025-3-27 13:05 作者: OCTO 時(shí)間: 2025-3-27 14:02
Epilogue. On Cinematic Disobediencewe employ an adaptive . to evaluate the . to achieve the task of associating the matches with the semantics. Moreover, we show how to translate the matches with semantics into schema mapping expressions, and use the . procedure to transform source data into target schemas. An experimental study show作者: 歪曲道理 時(shí)間: 2025-3-27 19:42 作者: Affiliation 時(shí)間: 2025-3-28 01:04
Paolo Mura,Keith Kay Hin Tan,Chun Wei Choysion, also frequently issued by users. We make the first attempt to solve a problem of computing dynamic skylines considering range queries in this paper. To deal with this problem, we propose an efficient algorithm based on the grid index and a novel variant of the well-known .-order curve. Moreove作者: commune 時(shí)間: 2025-3-28 04:05 作者: interrogate 時(shí)間: 2025-3-28 08:15
Palgrave Macmillan Memory Studiestext of first-order logic. We show that active-generic collapse carries over to second-order logic for structures with o-minimality and any relational signature in the complex value model. We also consider the problem of safety in the context of embedded finite complex value models and constraint complex value databases.作者: MUT 時(shí)間: 2025-3-28 13:03 作者: grotto 時(shí)間: 2025-3-28 17:15 作者: 別名 時(shí)間: 2025-3-28 21:16 作者: 適宜 時(shí)間: 2025-3-29 02:03
Adaptation in Theatre and Performancegorithms are proposed to answer the query efficiently. Experimental results show that our proposed algorithms are several times faster than a baseline algorithm on large-scale real datasets under a wide range of parameter settings.作者: periodontitis 時(shí)間: 2025-3-29 05:03
Adaptation in Theatre and Performance lifelog search system was implemented using the method. Experiments showed that our method is effective in compensating recognition errors of speech recognizers. We observed increase in both precision and recall. The results indicate that our method has an ability to reduce errors in the index of a lifelog search system.作者: FACET 時(shí)間: 2025-3-29 07:16
0302-9743 and uncertainty, stream processing, graph, XML, XML and graph, similarity, searching and digital preservation, spatial queries, query processing, as well as indexing and high performance.978-3-642-20151-6978-3-642-20152-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: ornithology 時(shí)間: 2025-3-29 13:07
Anatoly T. Fomenko,Vladislav A. Kibkaloure the key features of sentences and thus can be used to quantify similarity between sentences. Experimental results show that our approach has performance advantages compared with the state-of-the-art sentence matching methods.作者: 薄膜 時(shí)間: 2025-3-29 18:20 作者: CYN 時(shí)間: 2025-3-29 22:56
Palgrave Studies in Alternative Educationexperimental results demonstrate that our unified algorithm is several times faster than the existing best known algorithms for monitoring constrained . nearest neighbors queries, furthest . neighbors queries and aggregate . nearest neighbors queries.作者: 衰弱的心 時(shí)間: 2025-3-30 02:13 作者: PHONE 時(shí)間: 2025-3-30 04:30
Sherry Fresia Blankenship,Keith Kay Hin TanThird, we conduct a performance study, which demonstrates that EcoTop is indeed effective in improving the performance of top-. queries, while minimizing the communication traffic. Notably, our novel economic incentive model also discourages free-riding in M-P2P networks.作者: 武器 時(shí)間: 2025-3-30 09:30 作者: 心神不寧 時(shí)間: 2025-3-30 16:07
Towards Web Search by Sentence Queries: Asking the Web for Query Substitutionsnce query by which Web search engines return no or few search results for some reasons, our method enables users to collect more Web pages about the given sentence query or the sentences related to the query.作者: 注射器 時(shí)間: 2025-3-30 18:21 作者: guardianship 時(shí)間: 2025-3-30 23:26 作者: 擴(kuò)音器 時(shí)間: 2025-3-31 04:57 作者: ARCH 時(shí)間: 2025-3-31 08:05 作者: 在駕駛 時(shí)間: 2025-3-31 09:23
Finding the Sites with Best Accessibilities to Amenitiesgorithms are proposed to answer the query efficiently. Experimental results show that our proposed algorithms are several times faster than a baseline algorithm on large-scale real datasets under a wide range of parameter settings.作者: vanquish 時(shí)間: 2025-3-31 13:20 作者: photopsia 時(shí)間: 2025-3-31 19:21
Conference proceedings 2011ed and selected from a total of 225 submissions. The topics covered are social network, social network and privacy, data mining, probability and uncertainty, stream processing, graph, XML, XML and graph, similarity, searching and digital preservation, spatial queries, query processing, as well as indexing and high performance.作者: 忍耐 時(shí)間: 2025-4-1 01:41 作者: 無能性 時(shí)間: 2025-4-1 04:19
https://doi.org/10.1007/978-3-031-32346-1data structure “Weighted Indexing Map”(WIM) is presented. The WIM keeps an index of the weighted length information. Based on WIM, we propose an efficient algorithm, called .Neighbors, for answering the W.NN query. The experimental results show that our WIM based W.NN processing algorithm are effective and efficient.作者: 揭穿真相 時(shí)間: 2025-4-1 07:08 作者: interior 時(shí)間: 2025-4-1 12:02
The DISTARNET Approach to Reliable Autonomic Long-Term Digital Preservation archived. In this paper, we present DISTARNET, a fully distributed system that reliably executes pre-defined workflows for long-term preservation. Moreover, DISTARNET is designed as an open system that allows the curators of digital objects to specify new processes to cope with additional challenges.作者: 代理人 時(shí)間: 2025-4-1 18:14
Neighbors: A Method for Finding k Nearest Neighbors in Weighted Regionsdata structure “Weighted Indexing Map”(WIM) is presented. The WIM keeps an index of the weighted length information. Based on WIM, we propose an efficient algorithm, called .Neighbors, for answering the W.NN query. The experimental results show that our WIM based W.NN processing algorithm are effective and efficient.作者: GET 時(shí)間: 2025-4-1 21:00
Aggregate Farthest-Neighbor Queries over Spatial Dataree aggregate functions. The BF algorithm is incremental and IO optimal. Extensive experiments on both synthetic and real data sets confirm the efficiency and effectiveness of our proposed algorithms.作者: SHOCK 時(shí)間: 2025-4-2 00:37 作者: Ceramic 時(shí)間: 2025-4-2 04:03
