ADVANCES IN GEOPHYSICS docx
ADVANCES IN GEOPHYSICS docx
... earthquakes in the near future. This
information is extremely important for seismic and tsunami hazard plan-
ning, such as developing building codes in Alaska and managing land in
coastal ...
used here.
In
the computation, the initial water height in all grid spaces is
known.
In
the tsunami source region, the initial condition is given by the
At
[
-
ADVANCES
IN
GEOP...
Tài liệu Advances in Database Technology- P3 docx
... 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: ... queries in [10].
This is a low level definition. In contrast, our definition of moving queries is at end-
user level, which includes the notion of a focal object. Second, the work d...
Tài liệu Advances in Database Technology- P6 docx
... 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...
Tài liệu Advances in Database Technology- P8 docx
... 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 ... this watermark.
Computing and Handling Cardinal Direction Information
339
Fig. 6. Lines not crossing AB
Fig. 7. Area between an edge and a line
For example, in Fig. 6 lines and do not...
Tài liệu Advances in Database Technology- P9 docx
... 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...
Tài liệu Advances in Database Technology- P10 docx
... implications in different domains, since testing
the implication in each domain is easier. Now we show that this partitioning
idea is feasible. We say a comparison X A is in domain D if X and A are in
domain ... step in Theorem 1
is critical [19].
There are two containment mappings from to
Notice we do not have a containment mapping from the subgoal in to the
last subgoal in sin...
Tài liệu Advances in Database Technology- P11 docx
... of MLQ.
Data point insertion: When a new data point is inserted into the quadtree,
MLQ updates the summary information in each of the existing blocks that the
new data point maps into. It then ... using no more than
Let us define SSENC as the sum of squared errors of the data points in
block excluding those in its children. That is,
where is the set of data points in that do not map i...
Tài liệu Advances in Database Technology- P12 docx
... and since each iteration is actually
a generalized bargaining step, using a nested bargaining within a bargaining will only
increase the number of exchanged messages.
4
Experimental Study
In order ... be
computed quickly, in a single pass over the data tuples in in the (arbitrary) order
of their arrival. At any point in time, our query-processing algorithms can combine the
maintained...
Tài liệu Advances in Database Technology- P13 docx
... Srikant. Mining Sequential Patterns. In Proc. of the 11th Int.
Conf. on Data Engineering, Taipei, Taiwan, March 1995.
W. Aref, M. Elfeky, and A. Elmagarmid. Incremental, Online, and Merge Mining
of ... instead of
bursty output of punctuations whenever possible. In the eager approach, since
the index is incrementally built right upon receiving each punctuation and the
index is indirectly m...