標(biāo)題: Titlebook: Current Issues in Databases and Information Systems; East-European Confer Július ?tuller,Jaroslav Pokorny,Yoshifumi Masunaga Conference pro [打印本頁] 作者: Neogamist 時間: 2025-3-21 18:24
書目名稱Current Issues in Databases and Information Systems影響因子(影響力)
書目名稱Current Issues in Databases and Information Systems影響因子(影響力)學(xué)科排名
書目名稱Current Issues in Databases and Information Systems網(wǎng)絡(luò)公開度
書目名稱Current Issues in Databases and Information Systems網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Current Issues in Databases and Information Systems被引頻次
書目名稱Current Issues in Databases and Information Systems被引頻次學(xué)科排名
書目名稱Current Issues in Databases and Information Systems年度引用
書目名稱Current Issues in Databases and Information Systems年度引用學(xué)科排名
書目名稱Current Issues in Databases and Information Systems讀者反饋
書目名稱Current Issues in Databases and Information Systems讀者反饋學(xué)科排名
作者: Gullible 時間: 2025-3-21 23:38 作者: 傲慢物 時間: 2025-3-22 03:42
Glaucoma Grading Using Fundus Images accessing a data file. From our experiment using high-dimensional feature vectors, we show that our CBF scheme achieves better performance on the nearest neighbor search than its competitors, such as VA-File and X-tree.作者: Inertia 時間: 2025-3-22 07:19 作者: Infelicity 時間: 2025-3-22 10:37 作者: 小平面 時間: 2025-3-22 13:15
Database Systems as Middleware - Events, Notifications, Messagesem processes use this type of communication for decades. However, it is not well known as a mechanism on the application level - despite the fact that it has been employed for quite some time, e.g. in workflow systems [LeRo 2000]. The event-driven message passing paradigm becomes more and more impor作者: 小平面 時間: 2025-3-22 17:36
A New High-Dimensional Index Structure Using a Cell-Based Filtering Technique accessing a data file. From our experiment using high-dimensional feature vectors, we show that our CBF scheme achieves better performance on the nearest neighbor search than its competitors, such as VA-File and X-tree.作者: 畢業(yè)典禮 時間: 2025-3-22 23:54 作者: EWER 時間: 2025-3-23 01:43 作者: Mortal 時間: 2025-3-23 08:25 作者: audiologist 時間: 2025-3-23 10:50
Database Systems as Middleware - Events, Notifications, Messagesl technology had become a mature base for application development, new architectures where developed for the tight integration of data, procedures and all kinds of processing. This phase of DBS research and development was dominated by object-oriented database management and specific architectures l作者: 熒光 時間: 2025-3-23 17:03 作者: 配偶 時間: 2025-3-23 18:46
Caching for Mobile Communicationervices (PCS) network. The challenge of caching routing information for mobile clients lies in the uncertainty of the length of time that the information remains valid. We use expiration timestamps to safeguard against using stale cached data. We study a variety of caching algorithms and a variety o作者: 沙漠 時間: 2025-3-23 23:27
Efficient Cache Management Protocol Based on Data Locality in Mobile DBMSsbandwidth wireless channel. As the server in mobile environments may not have any information about the state of its clients’ cache(stateless server), using . to transmit the list of updated data to numerous concurrent mobile clients is an attractive approach. In this paper, a new caching method is 作者: anachronistic 時間: 2025-3-24 03:01 作者: chronology 時間: 2025-3-24 07:15 作者: 水槽 時間: 2025-3-24 11:29 作者: 消息靈通 時間: 2025-3-24 16:43 作者: inspired 時間: 2025-3-24 19:47
Mining around Association and Representative Rulesn rules generation in the context of changing user requirements. The data mining system user is frequently interested in results of mining around rules that consists in examining how change of attribute values or addition of new attributes influences the discovered dependencies. The set of associati作者: photopsia 時間: 2025-3-25 03:07
A New Algorithm for Page Access Sequencing in Join Processingcess sequence which requires the minimum number of buffer pages if there are no page reaccesses, and 2) finding a page access sequence which requires the minimum number of page reaccesses given a fixed buffer size. In general, a heuristic for the first problem can be converted to a corresponding heu作者: FLINT 時間: 2025-3-25 04:48
Data Organization Issues for Location-Dependent Queries in Mobile Computing query is .” We execute such queries based on location-dependent data involved in their processing. We build concept hierarchies based on the location data. These hierarchies define mapping among different granularities of locations. One such hierarchy is to generate domain knowledge about the citie作者: Verify 時間: 2025-3-25 10:51
Towards Intelligent Information Retrieval Engines: A Multi-agent Approachs thus posing the increasing need for fast and efficient methods for information filtering and retrieval. Intelligent agent communities may prove to be the needed item in transforming passive search and retrieval engines into active, evolving, personal assistants. In this paper we present a multi-ag作者: 平常 時間: 2025-3-25 12:34
Design and Implementation of a Novel Approach to Keyword Searching in Relational Databases the Web increasingly comes out of a database, it is crucial to be able to search . when working with the Web. Due to the highly dynamic nature of the Web, it is unlikely ever to know the underlying schemata of those databases. We remedy this situation by introducing an extension of SQL called . (RS作者: 專心 時間: 2025-3-25 18:21 作者: aerobic 時間: 2025-3-25 23:48
Hierarchical Materialisation of Method Results in Object-Oriented Viewsised, then it has to be kept up to date after objects used to compute the value of this method were updated. To this end we use additional data structures representing links between materialised methods and objects used to compute these methods. When such an object is updated, the system examines an作者: PACK 時間: 2025-3-26 01:24
Finding Generalized Path Patterns for Web Log Data Miningraversal patterns from web logs by considering the fact that irrelevant accesses to web documents may be interleaved within access patterns due to navigational purposes. We define a general type of pattern that takes into account this fact and also, we present a level-wise algorithm for the determin作者: Defraud 時間: 2025-3-26 04:53 作者: HPA533 時間: 2025-3-26 12:24
Distributed Searching of k-Dimensional Data with Almost Constant Costsalyze costs for insert and exact searches in an amortized framework. We show that both for the 1-dimensional and the . dimensional case insert and exact searches have an amortized almost constant costs, namely . (log(1+A-) n) messages, where . is the total number of servers of the structure, . is th作者: 飛行員 時間: 2025-3-26 15:22 作者: 使顯得不重要 時間: 2025-3-26 18:04 作者: 指派 時間: 2025-3-26 21:09 作者: Instrumental 時間: 2025-3-27 04:22
Writing Resistance in the Second World Warf the location-dependent attribute in a particular location. We extend concept hierarchies to include spatial indexes on the location-dependent attributes. Finally, we discuss how to partition and replicate relations based on the location to process the queries efficiently. We briefly discuss the implementation issues.作者: 蛛絲 時間: 2025-3-27 05:26 作者: Callus 時間: 2025-3-27 10:01 作者: Ascribe 時間: 2025-3-27 14:23 作者: 愛國者 時間: 2025-3-27 20:58 作者: Detoxification 時間: 2025-3-28 00:22
Managing Schemata for Semistructured Databases Using Constraintshema containment and describe how to test this condition, again, using constraints. We show how the knowledge of schema containment can be used for optimization. As a theoretical contribution we prove that, under some circumstances, schema matches can be found without any backtracking and in polynomial time.作者: 男學(xué)院 時間: 2025-3-28 02:10
A New Algorithm for Page Access Sequencing in Join Processingbetter than existing heuristics for data which is modelled with geometric graphs, and no worse in others, for the first problem. It performs similarly better for the second problem if the fixed buffer size is not much less than the maximum buffer size generated in the first problem.作者: constitute 時間: 2025-3-28 09:07
Data Organization Issues for Location-Dependent Queries in Mobile Computingf the location-dependent attribute in a particular location. We extend concept hierarchies to include spatial indexes on the location-dependent attributes. Finally, we discuss how to partition and replicate relations based on the location to process the queries efficiently. We briefly discuss the implementation issues.作者: Injunction 時間: 2025-3-28 12:55 作者: 特別容易碎 時間: 2025-3-28 15:21
Hierarchical Materialisation of Method Results in Object-Oriented Viewsasonable to materialise also the intermediate results of methods called from m. We call this technique . When an object used to materialise the result of m is updated, then m has to be recomputed. This recomputation can use unaffected intermediate materialised results, thus reducing the recomputation time.作者: Acetaldehyde 時間: 2025-3-28 19:44
Distributed Searching of k-Dimensional Data with Almost Constant Costst cost in real distributed structures..Only worst case analysis has been previously considered and the almost constant cost for the amortized analysis of the general k-dimensional case appears to be very promising in the light of the well known difficulties in proving optimal worst case bounds for k-dimensions.作者: Loathe 時間: 2025-3-29 02:41
Caching for Mobile Communicationion remains valid. We use expiration timestamps to safeguard against using stale cached data. We study a variety of caching algorithms and a variety of methods for setting timestamps based on client mobility. We report results from simulation studies.作者: 笨拙的我 時間: 2025-3-29 05:15 作者: graphy 時間: 2025-3-29 09:29
Wireless Mobile Communication and Healthcareproposed to support transaction semantics at mobile clients. The proposed protocol adopts . as the way of sending invalidation reports, in order to dynamically adapt to system workload (update pattern, data locality). We study the performance of the proposed protocol by means of simulation experiments.作者: 人造 時間: 2025-3-29 11:29
https://doi.org/10.1007/978-3-031-60742-4en, based on structures of Gabow et al. [.] and Beam and Fich [.] we describe an index scheme, which handles in an efficient way window queries in spatial database applications. In the general case in which the plane has real coordinates the above time results are slowed down by adding a logarithmic factor due to the normalization technique.作者: Encephalitis 時間: 2025-3-29 17:34
Publishing Satire: Collective Humouron rules is often huge. However it is possible to represent it with usually much smaller set of representative rules. If needed, the user can derive all association rules from the set of representative rules syntactically by means of a cover operator. Incremental solutions of mining around representative rules are discussed in the paper as well.作者: 過度 時間: 2025-3-29 20:10 作者: Pulmonary-Veins 時間: 2025-3-30 01:59 作者: Exploit 時間: 2025-3-30 04:48 作者: Distribution 時間: 2025-3-30 10:40 作者: DECRY 時間: 2025-3-30 15:02
Algorithms for Rewriting Aggregate Queries Using Viewsmplete for important cases. Our techniques can be used to improve well-known procedures for rewriting non-aggregate queries. These procedures can then be adapted to obtain algorithms for rewriting queries with . and . The algorithms presented are a basis for realizing optimizers that rewrite queries using views.作者: Astigmatism 時間: 2025-3-30 20:24
Design and Implementation of a Novel Approach to Keyword Searching in Relational Databasestabase. RSQL serves as a basis for a keyword-based search which renders it possible to formulate queries to databases in the absence of schema-knowledge. It is shown how this language can be exploited as a Web search engine that works on databases instead of documents.作者: 博愛家 時間: 2025-3-30 20:43
A Rule-Oriented Architecture to Incorporate Dissemination-Based Information Delivery into Informatiomation through dissemination-based delivery. We explain this requirement can be met by a combination of an information integration engine and event-driven rule processing scheme. We also explain prototype system development.作者: Influx 時間: 2025-3-31 03:55
Efficient Cache Management Protocol Based on Data Locality in Mobile DBMSsproposed to support transaction semantics at mobile clients. The proposed protocol adopts . as the way of sending invalidation reports, in order to dynamically adapt to system workload (update pattern, data locality). We study the performance of the proposed protocol by means of simulation experiments.作者: 擁護(hù)者 時間: 2025-3-31 05:05 作者: Banquet 時間: 2025-3-31 13:09 作者: 親屬 時間: 2025-3-31 17:15 作者: 使長胖 時間: 2025-3-31 19:27 作者: 維持 時間: 2025-3-31 23:47
Frontiers in Sociology and Social Researchion remains valid. We use expiration timestamps to safeguard against using stale cached data. We study a variety of caching algorithms and a variety of methods for setting timestamps based on client mobility. We report results from simulation studies.
