One-pass sampling of hierarchically organized sensors

Details One-pass sampling of hierarchically organized sensors One-pass sampling of hierarchically organized sensors

2011-04-26

2011-04-26

Wassum, Luke S. (Department: 2167)

Data processing: database and file management or data structures

Database and file access

Record, file, and data search and comparisons

C711S118000, C702S127000

Reexamination Certificate

active

07933919

ABSTRACT:
One-pass sampling is employed within a hierarchically organized structure to efficiently and expeditiously respond to sensor inquires. Identification of relevant sensors and sampling of those sensors is combined and performed in a single pass. Oversampling can also be employed to ensure a target sample size is met where some sensors fail or are otherwise unavailable. Further yet, sensor data can be cached and utilized to hasten processing as well as compensate for occasional sensor unavailability.

REFERENCES:
patent: 7143083 (2006-11-01), Carlbom et al.
patent: 2002/0087570 (2002-07-01), Jacquez et al.
patent: 2004/0024773 (2004-02-01), Stoffel et al.
patent: 2004/0218602 (2004-11-01), Hrastar
patent: 2004/0220965 (2004-11-01), Harville et al.
patent: 2005/0055376 (2005-03-01), Xie et al.
patent: 2005/0096841 (2005-05-01), Gedik et al.
patent: 2005/0120013 (2005-06-01), Chang et al.
patent: 2005/0137994 (2005-06-01), Fortin et al.
patent: 2006/0161645 (2006-07-01), Moriwaki et al.
patent: 2006/0271661 (2006-11-01), Qi et al.
patent: 2007/0088719 (2007-04-01), Staniford et al.
patent: 2007/0270672 (2007-11-01), Hayter
patent: 2008/0071465 (2008-03-01), Chapman et al.
patent: 2008/0104530 (2008-05-01), Santanche et al.
patent: 2008/0195584 (2008-08-01), Nath et al.
patent: 2009/0012633 (2009-01-01), Liu et al.
patent: 2009/0063099 (2009-03-01), Counts et al.
patent: 2009/0224941 (2009-09-01), Kansal et al.
patent: WO2006097734 (2006-09-01), None
patent: WO2007087615 (2007-08-01), None
Ganesan et al., “Multiresolution Storage and Search in Sensor Networks”, ACM Transactions on Storage, vol. 1, No. 3, Aug. 2005, ACM 2005, pp. 277-315.
Google Maps. http://maps.google.com/. Last accessed Feb. 19, 2008, 1 page.
Windows Live Local. http://local.live.com/. Last accessed Feb. 19, 2008, 1 page.
Kate Greene. Microsoft's plan to map the world in real time. MIT Technology Review, May 8, 2006 http://www.technologyreview.com/read\—article.aspx?id=16781&ch=infotech. Last accessed Feb. 19, 2008, 2 pages.
Christian Böhm, et al. Multidimensional index structures in relational databases. Journal of Intelligent Information Systems., 15(1):51-70, 2000. Last accessed Dec. 11, 2007, 21 pages.
Amol Deshpande, et al. MauveDB: Supporting Modelbased User Views inDatabase Systems, SIGMOD 2006, Jun. 27-29, 2006, Chicago, Illinois, USA, ACM 1595932569/06/0006. Last accessed Dec. 11, 2007, 12 pages.
Amol Deshpande, et al. Cache-and-query for wide area sensor databases. In ACM SIGMOD, 2003, San Diego, California USA. Last accessed Dec. 11, 2007, 12 pages.
Jim Gray, et al. The Five-Minute Rule Ten Years Later,and Other Computer Storage Rules of Thumb. Sep. 1997, Technical Report, MSR-TR-97-33. SIGMOD Record 26(4): 63-68 (1997). http://research.microsoft.com/˜gray/5—min—rule—SIGMOD.doc. Last accessed Dec. 11, 2007, 7 pages.
David Gross, et al. Uniform Generation in Spatial Constraint Databases and Applications, In ACM PODS, 2000.
A. Guttman. R-trees: A dynamic index structure for spatial searching. In SIGMOD, pp. 47-57, 1984. ACM O-89791-128-8/84/006/0047. Last accessed Dec. 11, 2007, 11 pages.
A.K.Jain, et al. Data Clustering: A Review, ACM Computing Surveys, vol. 31, No. 3, Sep. 1999. Last accessed Dec. 11, 2007, 60 pages.
I. Kamel, et al. On Packing R-trees. In CIKM, 1993. Last accessed Dec. 11, 2007, 20 pages.
I. Lazaridis, et al. Progressive approximate aggregate queries with a multi-resolution tree structure. In SIGMOD, 2001. Last accessed Dec. 11, 2007, 28 pages.
M. F. Mokbel, et al. Spatio-temporal Access Methods. IEEE Data Engineering Bulletin., 26(2):40-49, 2003. Last accessed Dec. 11, 2007, 11 pages.
A. Nanopoulos, et al. An Efficient and Effective Algorithm for Density Biased Sampling. CIKM'02, Nov. 4-9, 2002, McLean, VA, USA. ACM 1-58113-492-4/02/0011. Last accessed Dec. 11, 2007, 7 pages.
Suman Nath, et al. FlashDB: Dynamic Self-tuning Database for NAND Flash. In IPSN, 2007, Apr. 25-27, 2007, Cambridge, Massachusetts, USA. ACM 978-1-59593-638-7/07/0004. Last accessed Dec. 11, 2007, 10 pages.
Frank Olken, et al. Sampling from Spatial Databases. In ICDE,1993. 1063-6382/93 IEEE. Last accessed Feb. 19, 2008, 10 pages.
D. Papadias, et al. Indexing Spatio-Temporal Data Warehouses, 2002. Last accessed Dec. 11, 2007, 10 pages.
J. Yang, et al. Incremental Computation and Maintenance of Temporal Aggregates. The VLDB Journal (2003) 12:262-283 / Digital Object Identifier (DOI) 10.1007/s00778-003-0107-z. Published online: Sep. 17, 2003. Last accessed Dec. 11, 2007, 22 pages.
Y. Zhang, et al. ICEDB: Intermittently-Connected Continuous Query Processing. In ICDE, 2007. Last accessed Dec. 11, 2007, 10 pages.
Suman Nath, et al. Challenges in Building a Portal for Sensors WorldWide. WSW'06 at SenSys'06, Oct. 31, 2006, Boulder, Colorado, USA. ACM 1595933433/06/0011. http://research.microsoft.com
ec/publications/SensorMap—WSW2006.pdf. Last accessed Aug. 30, 2007, 5 pages.
Donghui Zhang, et al. Temporal and Spatio-Temporal Aggregations over Data Streams using Multiple Time Granularities http://citeseer.ist.psu.edu/cache/papers/cs2/459/http:zSzzSzwww.ccs.neu.eduzSzhomezSzdonghuizSzpublicationszSzhta—journal.pdf/zhang03temporal.pdf. Last accessed Aug. 30, 2007, 25 pages.
Deepak Ganesan, et al. Dimensions: Why Do We Need a New Data Handling Architecture for Sensor Networks? ACM SIGCOMM Computer Communications Review, vol. 33, No. 1: Jan. 2003. http://delivery.acm.org/10.1145/780000/77486/p143-ganesan.pdf?key1=774786&key2=051792881&coll=GUIDE&dl=GUIDE&CFID=28055539&CFTOKEN=22210286. Last accessed Aug. 30, 2007, 6 pages.

Affiliated with

Also associated with

Rating

One-pass sampling of hierarchically organized sensors does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with One-pass sampling of hierarchically organized sensors, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and One-pass sampling of hierarchically organized sensors will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2688197