... instance obtained by changing the given instance
using a minimal set of insertions/deletions. Intuitively, consistent query answers
are independent of the way the inconsistencies in the data would ... exclusion
constraints). Allowing union in the query language is crucial for being able to
extract indefinite disjunctive information from an inconsistent database (see Ex-
ample 1).
Future...
... watermark.
Energy-Conserving Air Indexes for Nearest Neighbor Search
51
Fig. 1. Data and Index Organization Using the Interleaving Technique
for broadcasting along with the data objects [8]. By first examining the index
information ... sorted according to the x-dimension since the grid cell is flat. Given
a query point shown in the figure, nine objects are broken into two lists, with one
co...
... 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 current databases ... 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...
... In Proc. Int. Symp. on Spatial Databases, pages 123–141,
Singapore, 1993.
Paul F. Dietz and Daniel D. Sleator. Two algorithms for maintaining order in a list.
In Proceedings of the nineteenth ... changes and maintain good levels of
resource provisioning for applications. Finally, critical areas that involve contin-
uously changing and voluminous spatio-temporal data include intelligent...
... instance obtained by changing the given instance
using a minimal set of insertions/deletions. Intuitively, consistent query answers
are independent of the way the inconsistencies in the data would ... exclusion
constraints). Allowing union in the query language is crucial for being able to
extract indefinite disjunctive information from an inconsistent database (see Ex-
ample 1).
Future...
... 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 velocity constrained indexing: ... “Incremental Clustering for Mining in a
Data Warehousing Environment”, VLDB 98
Ester M., Kriegel H P., Sander J., Xu X.: “A Density-Based Algorithm for Discovering Clusters
in Large...
... 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 ... xor-ing them) to obtain ciphertext.
Decryption involves reversing the process: combining the key-stream with the
ciphertext to obtain the original plaintext. Along with the initial encryption key,...
... following
information is maintained about each group of records
For each attribute we maintain the sum of corresponding values. The
corresponding value is given by We denote the corresponding first-
order ... 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 ... (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 form in wh...