... computa-
tional origins and information systems engineering aspects have received scant
attention. The development within the GRID community of the W3C-inspired
OGSA indicates a willingness to move in a direction ... commercial IT (Information Technology) including
process plant control, management information and decision support systems, IT-
assisted business processes and their re-en...
... nodes (as
in routing indexes [19]) providing for each node a partial view of the system.
Our approach is based on unstructured P2P systems with distributed indexes.
We propose maintaining as indexes ... Filters. VLDB International Workshop on
Databases, Information Systems and Peer-to-Peer Computing, 2003.
A. Crespo, H. Garcia-Molina. Routing Indices for Peer-to-Peer Systems. In ICDC...
... 2000.
T. Imielinski, S. Viswanathan, and B. Badrinath. Energy efficient indexing on air. In
SIGMOD, 1994.
J.Kucera and U. Lott. Single chip 1.9 ghz transceiver frontend mmic including Rx/Tx local
oscillators ... approaches in query processing for
moving object trajectories. In VLDB, 2000.
S. Prabhakar, Y. Xia, D. V. Kalashnikov, W. G. Aref, and S. E. Hambrusch. Query indexing
and velo...
... is based upon ciphertext, while, in the
second, the intermediate index is based upon plaintext and the final index is
obtained by encrypting the intermediate index. Based upon characteristics ... conforming to the NSM structure. During insertion,
a record is split into two sub-records and each is inserted into its corresponding
mini-page (sensitive or non-sensitive). As described in Secti...
... of Data Mining. ACM
SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discove
ry, (1996) 15–19.
Clifton C., Kantarcioglu M., Vaidya J.: Defining Privacy for Data Mining. National
Science ... Preserving Data Mining
195
data set is a good substitute for privacy preserving data mining algorithms. For
each dimension pair let the corresponding entries in the covariance matrix
f...
... relational
databases into an XML format or to store the information in an XML object in
a relational database, increasing the cost of e-business development. Moreover,
specifying the mapping in the application ... (such as preceding-sibling and following-sibling). Even more complex are
the following and preceding axes. Our goal in normalizing the Xpath expression
is to bring it to a f...
... optimizer.
Phonetic Matching. Most database systems allow matching text strings using pseudo-
phonetic Soundex algorithm originally defined in [11], primarily for Latin-based
scripts.
In summary, while ... environment.
5.3
Phonetic Indexing
We now outline a phonetic indexing technique that may be used for accessing the near-
equal phonemic strings, using a standard database index. We ex...
... designing the annotation
specifications, considering the specifics of data integrity constraint checking, and
ascertaining the impact on particular tools remain challenging (and interesting) tasks.
focuses ... Reasoning with Cardinal
Directions. In Proceedings of the 7th International Conference on Principles and
Practice of Constraint Programming (CP’02), volume 2470 of LNCS, pages 341–
35...
... pruning steps using can be done to
do more effective pruning, since the two sets are symmetric in this join problem.
4
Constructing NNH Using Good Pivots
Pivot points are vital to NNH for obtaining ... between index nodes from corresponding trees in a priority
queue and recursively (top-down) refining the search. In this case, using
histograms, one could perform, in addition to the ty...