Tài liệu Advances in Database Technology- P17 doc

... pseudocode of this algorithm is shown in Figure 4. First, the constraints are initialized by (i) introducing inverse temporal constraints for existing edges and (ii) assigning “dummy” constraints ... structure resembles the inverted file used in Information Retrieval systems [1] to record the occurrences of index terms in documents. 5.3 Indexing and Querying Patterns in DBMS Tables I...

Ngày tải lên: 24/12/2013, 02:18

... 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...

Ngày tải lên: 14/12/2013, 15:15

... 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 ... the XML document. Since the resulting tuples come in the same order as the final XML document no in- memory buffering is necessary and the result can be pipelined to a tagger componen...

Ngày tải lên: 14/12/2013, 15:16

... 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...

Ngày tải lên: 14/12/2013, 15:16

... 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...

Ngày tải lên: 24/12/2013, 02:18

... 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...

Ngày tải lên: 24/12/2013, 02:18

... 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...

Ngày tải lên: 24/12/2013, 02:18

... 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...

Ngày tải lên: 24/12/2013, 02:18

... Pattern Mining with Regular Expression Constraints. In Proc. of the 25th Int. Conf. on Very Large Databases, Edinburgh, Scotland, UK, September 1999. J. Han, G. Dong, and Y. Yin. Efficient Mining ... Patterns in Time Series Databases. In Proc. of the 15th Int. Conf. on Data Engineering, Sydney, Australia, March 1999. J. Han, W. Gong, and Y. Yin. Mining Segment-Wise Periodic Patterns in...

Ngày tải lên: 24/12/2013, 02:18

... quality. Before being integrated into a database query, the QoP inputs are translated into application QoS based on the information stored in the User Profile. For example, a user input of “VCD-like spatial ... H.V.: Evaluating structural similarity in XML documents. In: Proc. 5th Int. Workshop on the Web and Databases (WebDB 2002), Madison, Wisconsin, USA. (2002) 61–66 Sebastian, T.B....

Ngày tải lên: 24/12/2013, 02:18