Tài liệu ADVANCES IN AD HOC NETWORKING docx

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

... minimize the information loss in moving from clustering to clustering This information loss is given by We can also view the information loss as the increase in the uncertainty. Recall that Since H(A) ... pp 69-84. Bradley, P., Fayyad, U., & Reina, C. (1998). Scaling Clustering Algorithms to Large Databases. In proceedings of the Int’l Conference on Knowledge Discovery and Data Mini...

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

... the skyline in three steps: choosing q subsets of the lists, calculating their lower- dimensional skylines and merging the results as the subsequent sampling. Since skylines can already grow ... 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...

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 ... (i.e., in Fig. 9), in the fourth case, we use the south line of and in the last case, we use the north line of In all cases, we use the edges of that fall in the tile of that...

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

... 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 type of pruning ... con- taining a given point” can also occur in practice (for instance, in a publish- subscribe application where subscriptions define interval ranges as attributes, and events can be...

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

... projection pushing and join reordering in terms of the treewidth of the join graph. (Note that the focus in [28] is on projection pushing in recursive queries; the non-recursive case is not investigated.) While ... section. 5 Improvements Using Domain Information So far we have discussed in what cases we do not need to normalize queries in the containment test, and in what cases w...

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

... incremental updates (without storing individual data points), and (3) store information at different resolutions. We take advantage of these properties of the quadtree and add the following in ... Q). In MLQ, each instance of UDF execution is mapped to a data point in a multi-dimensional space. The summary information of data points is stored in the nodes of a quadtree. The summary in...

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 ... we adapt e-commerce trading negotiation methods to the problem. The result is a query-answers trading mechanism, where instead of trading goods, nodes trade answers of (parts of) queries in...

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

... see that as time advances, PJoin maintains an almost steady output rate whereas the output rate of XJoin drops. This decrease in XJoin output rate occurs because the XJoin state increases over ... neither window joins nor k-constraint-exploiting algorithms do. 6 Discussion: Extending PJoin Beyond Punctuations The current implementation of PJoin is a binary equi-join without exploiting wind...

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

... to maintain than a LIST without any indices or the T-INDEX. For 10000 distinct values, the G-INDEX with 50 groups is faster than the T-INDEX and faster than maintaining a sliding window using ... Department of Computer Science and Engineering, IIT Bombay, India. shaveen@cse.iitb.ac .in Abstract. We consider indexing sliding windows in main memory over on-line data streams. Our proposed dat...

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