Titlebook: Current Issues in Databases and Information Systems; East-European Confer Július ?tuller,Jaroslav Pokorny,Yoshifumi Masunaga Conference pro

FLINT

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

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

平常

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

專心

aerobic

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

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

HPA533

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

飛行員

使顯得不重要