we propose a dynamic sketch method by integrating sketch and histogram techniques, for aggregate queries over the network-constrained traffic data streams and build the index, to solve the problem of aggregate queries over the network-constrained moving objects

复件 (2) arb-tree\main.opt
.................\main.cpp
.................\result.txt
.................\accessed.txt
.................\main.dsp
.................\main.dsw
.................\main.ncb
.................\main.plg
.................\new.cpp
.................\rand.cpp
.................\rand.h
.................\rtree.dsw
.................\rtree.ncb
.................\rtree.plg
.................\rtree.dsp
.................\route1.txt
.................\average.txt
.................\rtree.opt
.................\beforedata\yanzheng.txt
.................\..........\shuchu.txt
.................\..........\min.txt
.................\..........\961.txt
.................\..........\8.txt
.................\..........\16.txt
.................\..........\32.txt
.................\..........\56.txt
.................\..........\72.txt
.................\..........\复件 72.txt
.................\..........\复件 8.txt
.................\..........\复件 32.txt
.................\..........\复件 56.txt
.................\..........\复件 (2) 96.txt
.................\..........\复件 96.txt
.................\..........\48.txt
.................\..........\96m.txt
.................\..........\96a.txt
.................\..........\14.txt
.................\..........\test29.txt
.................\..........\test96.txt
.................\..........\复件 16.txt
.................\..........\962.txt
.................\.file\bfile.cpp
.................\.....\bfile.h
.................\.....\WS_FTP.LOG
.................\.lockfile\cache.cpp
.................\.........\cache.h
.................\.........\blk_file.h
.................\.........\blk_file.cpp
.................\func\gendef.h
.................\....\functions.cpp
.................\heap\heap.h
.................\....\heap.cpp
.................\linlist\linlist.cpp
.................\.......\linlist.h
.................\my_math\my_math.cpp
.................\.......\my_math.h
.................\rand\Random.cpp
.................\....\Random.h
.................\.tree\entry.h
.................\.....\rtnode.h
.................\.....\rtree.h
.................\.....\rtnode.cpp
.................\.....\entry.cpp
.................\.....\rtree.cpp
.................\ds\hash(true)max.txt
.................\..\hash(true)average2.txt
.................\..\map(change).txt
.................\..\route1(change).txt
.................\..\hash(true)average.txt
.................\..\average.txt
.................\..\shuchu.txt
.................\..\hash(true)min.txt
.................\..\hash.txt
.................\..\复件 shuchu.txt
.................\..\shuchu2.txt
.................\..\复件 (2) shuchu.txt
.................\..\shuchu3.txt
.................\..\新建 文本文档.txt
.................\..\同一时刻不同路段.xls
.................\..\hash2.txt
.................\..\shuchuc.txt
.................\..\sketch.rb
.................\..\shuchu30.txt
.................\..\10-5.txt
.................\..\shuchu1-2.txt
.................\beforedata
.................\outdata
.................\bfile
.................\blockfile
.................\Debug
.................\func
.................\heap
.................\linlist
.................\my_math
.................\rand
.................\rtree
.................\trees
.................\ds
复件 (2) arb-tree

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．