System And Method For Offline Editing Of Data Files - Patent 7490109

Document Sample
System And Method For Offline Editing Of Data Files - Patent 7490109 Powered By Docstoc
					


United States Patent: 7490109


































 
( 1 of 1 )



	United States Patent 
	7,490,109



 Sikchi
,   et al.

 
February 10, 2009




System and method for offline editing of data files



Abstract

A system and method that enables a user to edit a data file offline is
     described. This system and method can enable a user to edit a data file
     without the user having to discover or deploy a solution application
     governing the data file. For security, this system and method can deploy
     a solution application within a sandbox, thereby limiting the operations
     the solution application can perform.


 
Inventors: 
 Sikchi; Prakash (Issaquah, WA), Narendran; Arungundram (Sammamish, WA), Yiu; Kelvin S. (Seattle, WA), Barac; Dragos (Bellevue, WA), Pavlicic; Miladin (Aachen, DE), Jha; Rajesh K. (Bellevue, WA) 
 Assignee:


Microsoft Corporation
 (Redmond, 
WA)





Appl. No.:
                    
11/276,585
  
Filed:
                      
  March 6, 2006

 Related U.S. Patent Documents   
 

Application NumberFiling DatePatent NumberIssue Date
 10395490Mar., 20037370066
 

 



  
Current U.S. Class:
  1/1  ; 707/999.001; 707/999.2
  
Current International Class: 
  G06F 17/30&nbsp(20060101)
  
Field of Search: 
  
  







 707/1,104.1,4,100,200 717/100,101,121
  

References Cited  [Referenced By]
U.S. Patent Documents
 
 
 
4201978
May 1980
Nally

4498147
February 1985
Agnew et al.

4514800
April 1985
Gruner et al.

4564752
January 1986
Lepic et al.

4641274
February 1987
Swank

4674040
June 1987
Barker et al.

4723211
February 1988
Barker et al.

4739477
April 1988
Barker et al.

4815029
March 1989
Barker et al.

4847749
July 1989
Collins et al.

4910663
March 1990
Bailey

4933880
June 1990
Borgendale et al.

4962475
October 1990
Hernandez et al.

5025484
June 1991
Yamanari et al.

5072412
December 1991
Henderson, Jr. et al.

5179703
January 1993
Evans

5182709
January 1993
Makus

5187786
February 1993
Densmore et al.

5191645
March 1993
Carlucci et al.

5195183
March 1993
Miller et al.

5204947
April 1993
Bernstein et al.

5206951
April 1993
Khoyi et al.

5218672
June 1993
Morgan et al.

5222160
June 1993
Sakai et al.

5228100
July 1993
Takeda et al.

5237680
August 1993
Adams et al.

5249275
September 1993
Srivastava

5274803
December 1993
Dubin et al.

5297249
March 1994
Bernstein et al.

5297283
March 1994
Kelly, Jr. et al.

5313631
May 1994
Kao

5313646
May 1994
Hendricks et al.

5317686
May 1994
Salas et al.

5333317
July 1994
Dann

5339423
August 1994
Beitel et al.

5339424
August 1994
Fushimi

5341478
August 1994
Travis, Jr. et al.

5369766
November 1994
Nakano et al.

5369778
November 1994
San Soucie et al.

5371675
December 1994
Greif et al.

5377323
December 1994
Vasudevan

5379419
January 1995
Heffeman et al.

5381547
January 1995
Flug et al.

5390325
February 1995
Miller

5396623
March 1995
McCall et al.

5408665
April 1995
Fitzgerald

5410646
April 1995
Tondevold et al.

5410688
April 1995
Williams et al.

5412772
May 1995
Monson

5434975
July 1995
Allen

5436637
July 1995
Gayraud et al.

5438659
August 1995
Notess et al.

5440744
August 1995
Jacobson et al.

5446842
August 1995
Schaeffer et al.

5455875
October 1995
Chevion et al.

5459865
October 1995
Heninger et al.

5481722
January 1996
Skinner

5497489
March 1996
Menne

5504898
April 1996
Klein

5517655
May 1996
Collins et al.

5535389
July 1996
Elder et al.

5542070
July 1996
LeBlanc et al.

5550976
August 1996
Henderson et al.

5551035
August 1996
Arnold et al.

5555325
September 1996
Burger

5566330
October 1996
Sheffield

5572643
November 1996
Judson

5572648
November 1996
Bibayan

5577252
November 1996
Nelson et al.

5581686
December 1996
Koppolu et al.

5581760
December 1996
Atkinson et al.

5600789
February 1997
Parker et al.

5602996
February 1997
Powers, III et al.

5608720
March 1997
Biegel et al.

5625783
April 1997
Ezekiel et al.

5627979
May 1997
Chang et al.

5630126
May 1997
Redpath

5634121
May 1997
Tracz et al.

5634124
May 1997
Khoyi et al.

5640544
June 1997
Onodera et al.

5644738
July 1997
Goldman et al.

5649099
July 1997
Theimer et al.

5659729
August 1997
Nielsen

5664178
September 1997
Sinofsky

5669005
September 1997
Curbow et al.

5682536
October 1997
Atkinson et al.

5689667
November 1997
Kurtenbach

5689703
November 1997
Atkinson et al.

5704029
December 1997
Wright, Jr.

5706501
January 1998
Horikiri et al.

5717939
February 1998
Bricklin et al.

5721824
February 1998
Taylor

5740439
April 1998
Atkinson et al.

5742504
April 1998
Meyer et al.

5745683
April 1998
Lee et al.

5745712
April 1998
Turpin et al.

5748807
May 1998
Lopresti et al.

5758184
May 1998
Lucovsky et al.

5758358
May 1998
Ebbo

5761408
June 1998
Kolawa et al.

5761683
June 1998
Logan et al.

5764984
June 1998
Loucks

5764985
June 1998
Smale

5778372
July 1998
Cordell et al.

5778402
July 1998
Gipson

5784555
July 1998
Stone

5790796
August 1998
Sadowsky

5798757
August 1998
Smith

5801701
September 1998
Koppolu et al.

5802304
September 1998
Stone

5806079
September 1998
Rivette et al.

5815830
September 1998
Anthony

5826265
October 1998
Van Huben et al.

5835777
November 1998
Staelin

5838906
November 1998
Doyle et al.

5842018
November 1998
Atkinson et al.

5845077
December 1998
Fawcett

5845090
December 1998
Collins, III et al.

5854630
December 1998
Nielsen

5859973
January 1999
Carpenter et al.

5862372
January 1999
Morris et al.

5862379
January 1999
Rubin et al.

5864819
January 1999
De Armas et al.

5907704
May 1999
Gudmundson et al.

5910895
June 1999
Proskauer et al.

5911776
June 1999
Guck

5915112
June 1999
Boutcher

5922072
July 1999
Hutchinson et al.

5928363
July 1999
Ruvolo

5929858
July 1999
Shibata et al.

5940075
August 1999
Mutschler, III et al.

5950010
September 1999
Hesse et al.

5956481
September 1999
Walsh et al.

5960199
September 1999
Brodsky et al.

5963964
October 1999
Nielsen

5973696
October 1999
Agranat et al.

5974454
October 1999
Apfel et al.

5982370
November 1999
Kamper

5983348
November 1999
Ji

5987480
November 1999
Donohue et al.

5991710
November 1999
Papineni et al.

5991731
November 1999
Colon et al.

5991877
November 1999
Luckenbaugh

5995103
November 1999
Ashe

5999740
December 1999
Rowley

6005570
December 1999
Gayraud et al.

6014135
January 2000
Fernandes

6016520
January 2000
Facq et al.

6018743
January 2000
Xu

6026379
February 2000
Haller et al.

6026416
February 2000
Kanerva et al.

6031989
February 2000
Cordell

6035297
March 2000
Van Huben et al.

6035309
March 2000
Dauerer et al.

6044205
March 2000
Reed et al.

6052531
April 2000
Waldin et al.

6052710
April 2000
Saliba et al.

6054987
April 2000
Richardson

6070184
May 2000
Blount et al.

6072870
June 2000
Nguyen et al.

6078326
June 2000
Kilmer et al.

6078327
June 2000
Liman et al.

6078924
June 2000
Ainsbury et al.

6081610
June 2000
Dwork et al.

6084585
July 2000
Kraft et al.

6088708
July 2000
Burch et al.

6091417
July 2000
Lefkowitz

6094657
July 2000
Hailpern et al.

6097382
August 2000
Rosen et al.

6098081
August 2000
Heidorn et al.

6108637
August 2000
Blumenau

6108783
August 2000
Krawczyk et al.

6115646
September 2000
Fiszman et al.

6121965
September 2000
Kenney et al.

6122647
September 2000
Horowitz et al.

6144969
November 2000
Inokuchi et al.

6151624
November 2000
Teare et al.

6154128
November 2000
Wookey et al.

6163772
December 2000
Kramer et al.

6167521
December 2000
Smith et al.

6167523
December 2000
Strong

6182094
January 2001
Humpleman et al.

6182095
January 2001
Leymaster et al.

6188401
February 2001
Peyer

6192367
February 2001
Hawley et al.

6195661
February 2001
Filepp et al.

6199204
March 2001
Donohue

6209128
March 2001
Gerard et al.

6216152
April 2001
Wong et al.

6219698
April 2001
Iannucci et al.

6225996
May 2001
Gibb et al.

6235027
May 2001
Herzon

6253366
June 2001
Mutschler, III

6253374
June 2001
Dresevic et al.

6263313
July 2001
Milsted et al.

6266810
July 2001
Tanaka et al.

6268852
July 2001
Lindhorst et al.

6272506
August 2001
Bell

6275227
August 2001
DeStefano

6275599
August 2001
Adler et al.

6279042
August 2001
Ouchi

6281896
August 2001
Alimpich et al.

6282711
August 2001
Halpern et al.

6286033
September 2001
Kishinsky et al.

6292897
September 2001
Gennaro et al.

6297819
October 2001
Furst

6300948
October 2001
Geller et al.

6307955
October 2001
Zank et al.

6308179
October 2001
Petersen et al.

6308273
October 2001
Goertzel et al.

6311271
October 2001
Gennaro et al.

6314415
November 2001
Mukherjee

6321259
November 2001
Ouellette et al.

6321334
November 2001
Jerger et al.

6327628
December 2001
Anuff et al.

6331864
December 2001
Coco et al.

6342907
January 2002
Petty et al.

6343149
January 2002
Motoiwa

6343302
January 2002
Graham

6345256
February 2002
Milsted et al.

6345278
February 2002
Hitchcock et al.

6345361
February 2002
Jerger et al.

6347323
February 2002
Garber et al.

6349408
February 2002
Smith

6351574
February 2002
Yair et al.

6353851
March 2002
Anupam et al.

6353926
March 2002
Parthesarathy et al.

6356906
March 2002
Lippert et al.

6357038
March 2002
Scouten

6366907
April 2002
Fanning et al.

6366912
April 2002
Wallent et al.

6367013
April 2002
Bisbee et al.

6369840
April 2002
Barnett et al.

6369841
April 2002
Salomon et al.

6374402
April 2002
Schmeidler et al.

6381742
April 2002
Forbes et al.

6381743
April 2002
Mutschler, III

6389434
May 2002
Rivette et al.

6393456
May 2002
Ambler et al.

6396488
May 2002
Simmons et al.

6405221
June 2002
Levine et al.

6405238
June 2002
Votipka

6408311
June 2002
Baisley et al.

6414700
July 2002
Kurtenbach et al.

6421070
July 2002
Ramos et al.

6421656
July 2002
Cheng et al.

6425125
July 2002
Fries et al.

6429885
August 2002
Saib et al.

6434563
August 2002
Pasquali et al.

6434564
August 2002
Ebert

6442563
August 2002
Bacon et al.

6442755
August 2002
Lemmons et al.

6446110
September 2002
Lection et al.

6449617
September 2002
Quinn et al.

6457009
September 2002
Bollay

6460058
October 2002
Koppolu et al.

6463419
October 2002
Kluss

6470349
October 2002
Heninger et al.

6473800
October 2002
Jerger et al.

6476828
November 2002
Burkett et al.

6476833
November 2002
Moshfeghi

6477544
November 2002
Bolosky et al.

6480860
November 2002
Monday

6487566
November 2002
Sundaresan

6490601
December 2002
Markus et al.

6493702
December 2002
Adar et al.

6501864
December 2002
Eguchi et al.

6502101
December 2002
Verprauskus et al.

6502103
December 2002
Frey et al.

6505200
January 2003
Ims et al.

6505230
January 2003
Mohan et al.

6505300
January 2003
Chen et al.

6507856
January 2003
Chen et al.

6516322
February 2003
Meredith

6519617
February 2003
Wanderski et al.

RE38070
April 2003
Spies et al.

6546546
April 2003
Van Doorn

6549221
April 2003
Brown et al.

6549878
April 2003
Lowry et al.

6549922
April 2003
Srivastava et al.

6553402
April 2003
Makarios et al.

6560616
May 2003
Garber

6560620
May 2003
Ching

6560640
May 2003
Smethers

6563514
May 2003
Samar

6571253
May 2003
Thompson et al.

6578144
June 2003
Gennaro et al.

6581061
June 2003
Graham

6584469
June 2003
Chiang et al.

6584548
June 2003
Bourne et al.

6585778
July 2003
Hind et al.

6589290
July 2003
Maxwell et al.

6594686
July 2003
Edwards et al.

6598219
July 2003
Lau

6603489
August 2003
Edlund et al.

6604099
August 2003
Chung et al.

6606606
August 2003
Starr

6609200
August 2003
Anderson et al.

6611822
August 2003
Beams et al.

6611840
August 2003
Baer et al.

6611843
August 2003
Jacobs

6613098
September 2003
Sorge et al.

6615276
September 2003
Mastrianni et al.

6629109
September 2003
Koshisaka

6631357
October 2003
Perkowski

6631379
October 2003
Cox

6631497
October 2003
Jamshidi et al.

6631519
October 2003
Nicholson et al.

6632251
October 2003
Rutten et al.

6635089
October 2003
Burkett et al.

6636845
October 2003
Chau et al.

6643633
November 2003
Chau et al.

6643652
November 2003
Helgeson et al.

6643684
November 2003
Malkin et al.

6651217
November 2003
Kennedy et al.

6654737
November 2003
Nunez

6654932
November 2003
Bahrs et al.

6658417
December 2003
Stakutis et al.

6658622
December 2003
Aiken et al.

6661920
December 2003
Skinner

6668369
December 2003
Krebs et al.

6671805
December 2003
Brown et al.

6678717
January 2004
Schneider

6681370
January 2004
Gounares et al.

6691230
February 2004
Bardon

6691281
February 2004
Sorge et al.

6697944
February 2004
Jones et al.

6701434
March 2004
Rohatgi

6701486
March 2004
Weber et al.

6704906
March 2004
Yankovich et al.

6711679
March 2004
Guski et al.

6720985
April 2004
Silverbrook et al.

6725426
April 2004
Pavlov

6728755
April 2004
de Ment

6735721
May 2004
Morrow et al.

6745367
June 2004
Bates et al.

6748385
June 2004
Rodkin et al.

6751777
June 2004
Bates et al.

6754874
June 2004
Richman

6757826
June 2004
Paltenghe

6757868
June 2004
Glaser et al.

6760723
July 2004
Oshinsky et al.

6763343
July 2004
Brooke et al.

6772139
August 2004
Smith, III

6772165
August 2004
O'Carroll

6774926
August 2004
Ellis et al.

6779154
August 2004
Nussbaum et al.

6781609
August 2004
Barker et al.

6782144
August 2004
Bellavita et al.

6799299
September 2004
Li et al.

6816849
November 2004
Halt, Jr.

6828992
December 2004
Freeman et al.

6845380
January 2005
Su et al.

6845499
January 2005
Srivastava et al.

6847387
January 2005
Roth

6848078
January 2005
Birsan et al.

6871220
March 2005
Rajan et al.

6874130
March 2005
Baweja et al.

6876996
April 2005
Czajkowski et al.

6889359
May 2005
Conner et al.

6901403
May 2005
Bata et al.

6915454
July 2005
Moore et al.

6931532
August 2005
Davis et al.

6941510
September 2005
Ozzie et al.

6941511
September 2005
Hind et al.

6941521
September 2005
Lin et al.

6948129
September 2005
Loghmani

6948133
September 2005
Haley

6948135
September 2005
Ruthfield et al.

6950980
September 2005
Malcolm

6961897
November 2005
Peel, Jr. et al.

6963875
November 2005
Moore et al.

6968503
November 2005
Chang et al.

6968505
November 2005
Stoll et al.

6993714
January 2006
Kaler et al.

6996776
February 2006
Makely et al.

6996781
February 2006
Myers et al.

7000179
February 2006
Yankovich et al.

7002560
February 2006
Graham

7003722
February 2006
Rothchiller et al.

7010580
March 2006
Fu et al.

7020869
March 2006
Abriari et al.

7024417
April 2006
Russakovsky et al.

7032170
April 2006
Poulose

7036072
April 2006
Sulistio et al.

7039875
May 2006
Khalfay et al.

7051273
May 2006
Holt et al.

7058663
June 2006
Johnston et al.

7062764
June 2006
Cohen et al.

7065493
June 2006
Homsi

7080083
July 2006
Kim et al.

7080325
July 2006
Treibach-Heck et al.

7086009
August 2006
Resnick et al.

7086042
August 2006
Abe et al.

7088374
August 2006
David et al.

7100147
August 2006
Miller et al.

7103611
September 2006
Murthy et al.

7106888
September 2006
Silverbrook et al.

7107282
September 2006
Yalamanchi

7107521
September 2006
Santos

7120863
October 2006
Wang

7130885
October 2006
Chandra et al.

7143341
November 2006
Kohli

7146564
December 2006
Kim et al.

7152205
December 2006
Day et al.

7168035
January 2007
Bell et al.

7178166
February 2007
Taylor et al.

7190376
March 2007
Tonisson

7191394
March 2007
Ardeleanu et al.

7213200
May 2007
Abe et al.

7236982
June 2007
Zlatanov et al.

7272789
September 2007
O'Brien

7281018
October 2007
Begun et al.

7296017
November 2007
Larcheveque et al.

7313758
December 2007
Kozlov

7316003
January 2008
Dulepet et al.

7318237
January 2008
Moriconi et al.

7334178
February 2008
Stanciu et al.

7346848
March 2008
Ruthfield et al.

2001/0007109
July 2001
Lange

2001/0022592
September 2001
Alimpich et al.

2001/0024195
September 2001
Hayakawa

2001/0037345
November 2001
Kieman et al.

2001/0054004
December 2001
Powers

2001/0056429
December 2001
Moore et al.

2001/0056460
December 2001
Sahota et al.

2002/0010700
January 2002
Wotring

2002/0010743
January 2002
Ryan et al.

2002/0010746
January 2002
Jilk, Jr. et al.

2002/0013788
January 2002
Pennell et al.

2002/0019941
February 2002
Chan et al.

2002/0023113
February 2002
Hsing et al.

2002/0026441
February 2002
Kutay et al.

2002/0026461
February 2002
Kutay et al.

2002/0032590
March 2002
Anand et al.

2002/0032692
March 2002
Suzuki et al.

2002/0032706
March 2002
Perla et al.

2002/0032768
March 2002
Voskuil

2002/0035579
March 2002
Wang et al.

2002/0035581
March 2002
Reynar et al.

2002/0040469
April 2002
Pramberger

2002/0054126
May 2002
Gamon

2002/0057297
May 2002
Grimes et al.

2002/0065798
May 2002
Bostleman et al.

2002/0065847
May 2002
Furukawa et al.

2002/0070973
June 2002
Croley

2002/0078074
June 2002
Cho et al.

2002/0078103
June 2002
Gorman et al.

2002/0083318
June 2002
Larose

2002/0099952
July 2002
Lambert et al.

2002/0100027
July 2002
Binding et al.

2002/0112224
August 2002
Cox

2002/0129056
September 2002
Conant

2002/0133484
September 2002
Chau et al.

2002/0152222
October 2002
Holbrook

2002/0152244
October 2002
Dean et al.

2002/0156772
October 2002
Chau et al.

2002/0156846
October 2002
Rawat et al.

2002/0156929
October 2002
Hekmatpour

2002/0169752
November 2002
Kusama et al.

2002/0169789
November 2002
Kutay et al.

2002/0174147
November 2002
Wang et al.

2002/0174417
November 2002
Sijacic et al.

2002/0178380
November 2002
Wolf et al.

2002/0184219
December 2002
Preisig et al.

2002/0188597
December 2002
Kern et al.

2002/0188613
December 2002
Chakraborty et al.

2002/0194219
December 2002
Bradley et al.

2002/0196281
December 2002
Audleman et al.

2002/0196288
December 2002
Emrani

2002/0198891
December 2002
Li et al.

2002/0198935
December 2002
Crandall et al.

2003/0004951
January 2003
Chokshi

2003/0007000
January 2003
Carlson et al.

2003/0014397
January 2003
Chau et al.

2003/0018668
January 2003
Britton et al.

2003/0020746
January 2003
Chen et al.

2003/0023641
January 2003
Gorman et al.

2003/0025732
February 2003
Prichard

2003/0026507
February 2003
Zlotnick

2003/0028550
February 2003
Lee et al.

2003/0037303
February 2003
Bodlaender et al.

2003/0043986
March 2003
Creamer et al.

2003/0046665
March 2003
Ilin

2003/0048301
March 2003
Menninger

2003/0051243
March 2003
Lemmons et al.

2003/0055811
March 2003
Stork et al.

2003/0055828
March 2003
Koch et al.

2003/0056198
March 2003
Al-Azzawe et al.

2003/0061386
March 2003
Brown et al.

2003/0061567
March 2003
Brown et al.

2003/0084424
May 2003
Reddy et al.

2003/0093755
May 2003
O'Carroll

2003/0110443
June 2003
Yankovich et al.

2003/0120578
June 2003
Newman

2003/0120651
June 2003
Bernstein et al.

2003/0120659
June 2003
Anandampilla

2003/0120671
June 2003
Kim et al.

2003/0120686
June 2003
Kim et al.

2003/0126555
July 2003
Aggarwal et al.

2003/0128196
July 2003
Lapstun et al.

2003/0135825
July 2003
Gertner et al.

2003/0140132
July 2003
Champagne et al.

2003/0142072
July 2003
Lapstun et al.

2003/0149934
August 2003
Worden

2003/0158897
August 2003
Ben-Natan et al.

2003/0163285
August 2003
Nakamura et al.

2003/0167277
September 2003
Hejlsberg et al.

2003/0182268
September 2003
Lal

2003/0182327
September 2003
Ramanujam et al.

2003/0187756
October 2003
Klivington et al.

2003/0187930
October 2003
Ghaffar et al.

2003/0188260
October 2003
Jensen et al.

2003/0189593
October 2003
Yarvin

2003/0192008
October 2003
Lee

2003/0200506
October 2003
Abe et al.

2003/0204511
October 2003
Brundage et al.

2003/0204814
October 2003
Elo et al.

2003/0205615
November 2003
Marappan

2003/0212664
November 2003
Brelning et al.

2003/0212902
November 2003
van der Made

2003/0217053
November 2003
Bachman et al.

2003/0220930
November 2003
Milleker et al.

2003/0225469
December 2003
DeRemer et al.

2003/0225768
December 2003
Chaudhuri et al.

2003/0225829
December 2003
Pena et al.

2003/0226132
December 2003
Tondreau et al.

2003/0233374
December 2003
Spinola et al.

2003/0236859
December 2003
Vaschillo et al.

2003/0237046
December 2003
Parker et al.

2003/0237047
December 2003
Borson

2004/0002939
January 2004
Arora et al.

2004/0003031
January 2004
Brown et al.

2004/0003353
January 2004
Rivera et al.

2004/0003389
January 2004
Reynar et al.

2004/0010752
January 2004
Chan et al.

2004/0024842
February 2004
Witt

2004/0030991
February 2004
Hepworth et al.

2004/0039990
February 2004
Bakar et al.

2004/0039993
February 2004
Kougiouris et al.

2004/0044961
March 2004
Pesenson

2004/0044965
March 2004
Toyama et al.

2004/0054966
March 2004
Busch et al.

2004/0059754
March 2004
Barghout et al.

2004/0073565
April 2004
Kaufman et al.

2004/0073868
April 2004
Easter et al.

2004/0078756
April 2004
Napper et al.

2004/0083426
April 2004
Sahu

2004/0088652
May 2004
Abe et al.

2004/0093596
May 2004
Koyano

2004/0107367
June 2004
Kisters

2004/0117769
June 2004
Lauzon et al.

2004/0123277
June 2004
Schrader et al.

2004/0146199
July 2004
Berkner et al.

2004/0163041
August 2004
Engel

2004/0172442
September 2004
Ripley

2004/0181711
September 2004
Johnson et al.

2004/0186762
September 2004
Beaven et al.

2004/0189716
September 2004
Paoli et al.

2004/0194035
September 2004
Chakraborty

2004/0205473
October 2004
Fisher et al.

2004/0205525
October 2004
Murren et al.

2004/0205534
October 2004
Koelle

2004/0205571
October 2004
Adler et al.

2004/0205592
October 2004
Huang

2004/0205605
October 2004
Adler et al.

2004/0205653
October 2004
Hadfield et al.

2004/0205671
October 2004
Sukehiro et al.

2004/0210599
October 2004
Friedman et al.

2004/0221238
November 2004
Cifra et al.

2004/0221245
November 2004
Chickles et al.

2004/0237030
November 2004
Malkin

2004/0261019
December 2004
Imamura et al.

2004/0268229
December 2004
Paoli et al.

2005/0004893
January 2005
Sangroniz

2005/0005248
January 2005
Rockey et al.

2005/0015279
January 2005
Rucker

2005/0015732
January 2005
Vedula et al.

2005/0022115
January 2005
Baumgartner et al.

2005/0027757
February 2005
Kiessig et al.

2005/0033728
February 2005
James

2005/0038711
February 2005
Marlelo

2005/0055627
March 2005
Lloyd et al.

2005/0060324
March 2005
Johnson et al.

2005/0060721
March 2005
Choudhary et al.

2005/0065933
March 2005
Goering

2005/0065936
March 2005
Goering

2005/0066287
March 2005
Tattrie et al.

2005/0071752
March 2005
Marlatt

2005/0076049
April 2005
Qubti et al.

2005/0091285
April 2005
Krishnan et al.

2005/0091305
April 2005
Lange et al.

2005/0102370
May 2005
Lin et al.

2005/0102612
May 2005
Allan et al.

2005/0108104
May 2005
Woo

2005/0108624
May 2005
Carrier

2005/0114757
May 2005
Sahota et al.

2005/0132196
June 2005
Dietl

2005/0138086
June 2005
Pecht-Seibert

2005/0138539
June 2005
Bravery et al.

2005/0171746
August 2005
Thalhammer-Reyero

2005/0198086
September 2005
Moore et al.

2005/0198125
September 2005
Beck et al.

2005/0198247
September 2005
Perry et al.

2005/0210263
September 2005
Levas et al.

2005/0223063
October 2005
Chang et al.

2005/0223320
October 2005
Brintzenhofe et al.

2005/0246304
November 2005
Knight et al.

2005/0268222
December 2005
Cheng

2006/0020586
January 2006
Prompt et al.

2006/0026534
February 2006
Ruthfield et al.

2006/0031757
February 2006
Vincent, III

2006/0036995
February 2006
Chickles et al.

2006/0041838
February 2006
Khan

2006/0059107
March 2006
Elmore et al.

2006/0059434
March 2006
Boss et al.

2006/0069605
March 2006
Hatoun

2006/0069985
March 2006
Friedman et al.

2006/0080657
April 2006
Goodman

2006/0085409
April 2006
Rys et al.

2006/0101037
May 2006
Brill et al.

2006/0101051
May 2006
Carr et al.

2006/0129978
June 2006
Abriani et al.

2006/0143220
June 2006
Spencer, Jr.

2006/0161559
July 2006
Bordawekar et al.

2006/0200754
September 2006
Kablesh et al.

2007/0036433
February 2007
Teutsch

2007/0050719
March 2007
Lui et al.

2007/0061467
March 2007
Essey

2007/0061706
March 2007
Cupala

2007/0074106
March 2007
Ardeleanu

2007/0094589
April 2007
Paoli

2007/0100877
May 2007
Paoli

2007/0101280
May 2007
Paoli

2007/0118803
May 2007
Walker et al.

2007/0130504
June 2007
Betancourt et al.

2007/0186157
August 2007
Walker et al.

2007/0208606
September 2007
MacKay et al.

2007/0208769
September 2007
Boehm et al.

2008/0028340
January 2008
Davis



 Foreign Patent Documents
 
 
 
1221661
Jul., 2002
EP

WO0157720
Aug., 2001
WO

WO-WO0157720
Sep., 2006
WO



   
 Other References 

"Microsoft Word 2000 Screenshots", (2000), 11-17. cited by other
.
XmlSpy, "XmlSpy 2004 Enterprise Edition Manual", Altova,(May 17, 2004),1-25, 220-225. cited by other
.
StylusStudio, "StylusStudio: XPath Tools", 2004-2007, StylusStudio, 1-14. cited by other
.
Dodds, "Toward an XPath API", xml.com,(May 7, 2001), 1-3. cited by other
.
Altova, "Altova Tools for XPath 1.0/2.0", Altova, 1-12. cited by other
.
"Microsoft Word 2000 Screenshots", Word,(2000), 1-17. cited by other
.
Grosso, et al., "XML Fragment Interchange", W3C,(Feb. 2001), 1-28. cited by other
.
Altova, et al., "User and Reference Manual Version 4.4", www.xmlspy.com, (May 24, 2007), 1-565. cited by other
.
"XForm 1.0", W3C,(Jul. 16, 2001). cited by other
.
Hu, et al., "A Programmable Editor for Developing Structured Documents based on Bidirectional Transformations", ACM,(Aug. 2004), 178-179. cited by other
.
Bradley, Neil "The XML Companion, Third Edition", Published by Addison Wesley Professional, http://proquest.safaribooksonline.com0201770598, http,(Dec. 12, 2001), 1-18. cited by other
.
Klarlund, Nils "DSD: A Schema Language for XML", ACM, FSMP Portland Oregon, (2000), 101-111. cited by other
.
Watt, Andrew "MIcrosoft Office Infopath 2003 Kick Start", (Published by Sams) Print ISBN-10:0-672-32623-X, (Mar. 24, 2004), 1-57. cited by other
.
Cover, XML Forms Architecture, retrieved at << http://xml.coverpages.org/xfa.html>> on Aug. 17, 2006, Coverpages, Jun. 16, 1999. cited by other
.
Raggett, "HTML Tables", retrieved on Aug. 6, 2006, at <<http:www://is-edu.homuns.edu.vn/WebLib/books/Web/Tel/html3-tables- .html>>, W3C Internet Draft, Jul. 7, 1995, pp. 1-12. cited by other
.
Ben-Natan, U.S. Appl. No. 60/203,081, filed May 9, 2000, entitled "Internet platform for creating and supporting communities." cited by other
.
Kutay, U.S. Appl. No. 60/209,713 filed Jun. 5, 2000, entitled, "Methods and systems for accessing, organizing presenting and viewing data." cited by other
.
Moore, U.S. Appl. No. 60/191,662 filed Mar. 23, 2000, entitled "Collection-based presistent digital archives." cited by other
.
"Webopedia Computer Dictionary" retrieved on May 9, 2006, at <<http://www.pewebopedia.com/TERM/O/OLE.html>>, Jupitermedia Corporation, 2006, pp. 07. cited by other
.
Baraband et al., PowerForms: "Declarative Client Site Form Field Validation", World Wide Web, Baltzer Science Publishers, Bussum, NL. vol. 3, No. 4, Dec. 2000, p. 1-20. cited by other
.
Altova, Inc., "XML Spy 4.0 Manual," Altova Inc. & Altova GmbH, coyright 1998-2001, Chapters 1, 2, and 6, encompassing pp. 1-17, 18-90, and 343-362. cited by other
.
Cybook, Inc.: "Copying the Search Form to Services-based Web Sites" INternet Article, (online) Jul. 26, 2004. *the whole document*. cited by other
.
Excel Developer Tip (hereinafter "Excel"), "Determining the Data Type of a Cell", May 13, 1998, p. 1 (available at http://jwalk.com/ss//excel/tips/tip62.htm). cited by other
.
Rado, Dave: "How to create a template that makes it easy for users to `fill in the blanks`, without doing any programming" Microsoft Word MVP FAQ Site, (online) Apr. 30, 2004, the whole document. cited by other
.
"Enter Key", Retrieved from the Internet at http://systems.webopedia.com/TERM/Enter.sub.--key.html on Dec. 20, 2006. cited by other
.
"Microsoft Visual Basic 5.0 Programmer's Guide", Microsoft Press, (1997),pp. 42-43, 54-58. cited by other
.
"Microsoft Word 2000", Screenshots,(1999), 1-5. cited by other
.
Beauchemin, Dave , "Using InfoPath to Create Smart Forms", Retrieved from the Internet at http:/www.microsoft.com/office/infopath/prodinfo/using.mspx on Jan. 21, 2007,(Mar. 27, 2003). cited by other
.
Begun, Andrew , et al., "Support and Troubleshooting for XML Schemas in InfoPath 2003", Microsoft Office InfoPath 2003 Technical Articles, Retrieved from the Internet at http://msdn2.microsoft.com/en-us/library/aa168241(office.11,d=printer).as- px
on Jan. 21, 2007,(Aug. 2004). cited by other
.
Borland, Russo , "Running Microsoft Word 97", 314-315, 338, 361-362, 390, and 714-719. cited by other
.
Brabrand, et al., "Power Forms Declarative Client-side Form Field Validation", (2002), 1-20. cited by other
.
Dubinko, Micah , "XForms and Microsoft InfoPath", Retrieved from the Internet at http://www.xml.com/lpt/a/1311 on Jan. 21, 2007,(Oct. 29, 2003). cited by other
.
Hoffman, Michael , "Architecture of Microsoft Office InfoPath 2003", Microsoft Office InfoPath 2003 Technical Articles, Retrieved from the Internet at http://msdn2.microsoft.com/en-us/library/aa219024(office.11,d=printer).as- px on Jan. 21,
2007,(Jun. 2003). cited by other
.
Lehtonen, Miro , et al., "A Dynamic User Interface for Document Assembly", Department of Computer Science, University of Helsinki,(Nov. 2002). cited by other
.
Nelson, Joe , "Client-side Form Validation Using JavaScript", Developer Advisory, (Sep. 21, 2001). cited by other
.
Raman, T. V., et al., "XForms 1.0", (Dec. 2001),Section 1-12.2.3 & Appendices A-G. cited by other
.
Rees, Michael J., "Evolving the Browser Towards a Standard User Interface Architecture", School of Information Technology, Bond University, Australia,(2001). cited by other
.
Singh, Darshan , "Microsoft InfoPath 2003 By Example", Retrieved from the Internet at http://www.perfectxml.com/InfoPath.asp on Jan. 21, 2007,(Apr. 20, 2003). cited by other
.
Udell, Jon , "InfoPath and XForms", Retrieved from the Internet at http://weblog.infoworld.com/udell/2003/02/26.html,(Feb. 26, 2003). cited by other
.
Anat, Eyal et al., "Integrating and Customizing Hererogeneous E-Commerce Applications", The VLDB Journal-The International Journal on Very Large Data Bases, vol. 10, Issue 1,(Aug. 2001),16-38. cited by other
.
Adams, Susie et al., "BizTalk Unleashed", Sams publishing, 2002, first printing Mar. 2001,1-2, 31-138. cited by other
.
Vasters, Clemens F., "BizTalk Server 2000 A Beginner's Guide", Osborne/McGraw-Hill,(2001),1-2, 359-402. cited by other
.
Halberg, Bruce et al., "Using Microsoft Excel 97", (1997),191-201, 213-219. cited by other
.
Villard, et al., "An Incremental XSLT Transformation Processor for XML Document Manipulation", http://www2002.org/CDROM/refereed/321, Printed on May 18, 2007,(May 2002),25 pages. cited by other.  
  Primary Examiner: Lewis; Cheryl



Parent Case Text



CROSS-REFERENCE TO RELATED APPLICATIONS


This is a continuation of and priority is claimed to U.S. patent
     application Ser. No. 10/395,490, a filing date of Mar. 24, 2003, now U.S.
     Pat. No. 7,370,066 for "SYSTEM AND METHOD FOR OFFLINE EDITING OF DATA
     FILES" of Sikchi et al. This U.S. patent application is commonly assigned
     herewith and is hereby incorporated herein by reference for all that is
     discloses.

Claims  

The invention claimed is:

 1.  A method comprising: receiving input to open a data file written in a mark-up language and having a solution;  discovering, without user interaction, the solution in
an offline memory source;  deploying, without user interaction, the solution;  and opening the data file.


 2.  The method of claim 1, wherein the deploying is within a sandbox.


 3.  The method of claim 1, wherein discovering the solution includes discovering a solution identifier in the data file, computing a special name from the solution identifier, and discovering the solution using the special name.


 4.  The method of claim 1 further comprising, prior to deploying the solution;  updating the solution discovered in the offline memory source with a newer solution.


 5.  The method of claim 1, wherein the data file includes primarily data.


 6.  The method of claim 1, wherein the solution includes a presentation application.


 7.  The method of claim 1, wherein the solution includes a logic application.


 8.  The method of claim 1, wherein opening the data file is performed with the solution and produces an electronic form.


 9.  A computer-readable medium comprising computer-executable instructions that perform the method of claim 1 when executed by a computer.


 10.  The method of claim 1, wherein the mark-up language is XML.


 11.  A method comprising: receiving input to open a data file having a solution previously received from an online memory source;  discovering a solution identifier in the data file;  computing a special name corresponding to the solution
identifier;  searching local memory for the special name;  and installing the solution found in a folder in the local memory and having the special name.


 12.  The method of claim 11, further comprising: opening the data file using the installed solution.


 13.  The method of claim 11, wherein the special name is unique.


 14.  A computer-readable medium comprising computer-executable instructions that perform the method of claim 11 when executed by a computer.


 15.  The method of claim 11, wherein the data file is written in a mark-up language.


 16.  The method of claim 15, wherein the mark-up language comprises XML.


 17.  An apparatus comprising: means for displaying a representation of a data file governed by a solution application received from an online memory source;  means for selecting the data file;  means for discovering and deploying, without user
interaction, the solution application governing the data file from an offline memory source;  means for displaying an electronic form representing a product of the solution application and the data file;  means for enabling a user to enter information
into the electronic form;  means for receiving information entered into the electronic form;  and means for altering the data file to reflect the information received.


 18.  The apparatus of claim 17, wherein the data file is written in a mark-up language.


 19.  The apparatus of claim 18, wherein the mark-up language comprises XML.  Description  

BACKGROUND


Extensible markup language (XML) is increasingly becoming the preferred format for transferring data.  XML is a tag-based hierarchical language that is extremely rich in terms of the data that it can be used to represent.  For example, XML can be
used to represent data spanning the spectrum from semi-structured data (such as one would find in a word processing document) to generally structured data (such as that which is contained in a table).  XML is well-suited for many types of communication
including business-to-business and client-to-server communication.  For more information on XML, XSLT, and XSD (schemas), the reader is referred to the following documents which are the work of, and available from the W3C (World Wide Web consortium): XML
Schema Part 2: Datatypes; XML Schema Part 1: Structures, and XSL Transformations (XSLT) Version 1.0; and XML 1.0 second edition specification.


One of the reasons that data files written in XML are often preferred for transferring data is that XML data files contain data, rather than a combination of data and the software application needed to edit the data.  One problem with XML data
files, however, is that to edit an XML data file, a user needs to first install a solution software application used to access, view, and edit the data file.


When a user is online, his computer can run a host application capable of accessing the Internet, such as Microsoft.RTM.  Internet Explorer.RTM., which can silently discover and deploy an XSLT, which enables the user to author and access an XML
data file.


If a user wishes to save an XML data file for later, offline use, however, the user may encounter various problems.  In some cases, a user wishing to reopen an XML data file offline will not be able to do so because he can no longer discover and
deploy the XML data file's solution application.  The user can no longer discover a solution if he is no longer online and the solution is accessible only online.  In other cases, a user can access and deploy the solution application, but to do so the
user must proactively discover the solution's name and where on his computer it resides, which a user may not know.  And sometimes, a user's host application discovers the solution's name and where it resides, but the user has to instruct his computer to
deploy the solution application, rather than the computer automatically opening, the solution file when the user attempts to open the corresponding XML data file.


Even in those cases where a user can continue to author and access an XML data file offline by actively installing the XML data file's solution application, there often is another problem.  When a user instructs his host application to open a
solution for an XML data file, his host application may trust the solution, thereby setting the user's computer at risk.  A solution originally accessed online could, for instance, contain a virus or worm.  When the user instructs his host application to
install the solution, it could introduce the virus or worm.


For these reasons, editing data files offline can be inconvenient and dangerous.


SUMMARY


The following description and figures describe an offline editing tool enabling offline editing of a data file with silent discovery and deployment of the data file's solution.  This offline editing tool enables a user to edit data files by
performing certain actions before the user attempts to edit the data file while offline.  When a user first opens a data file when online, for instance, the editing tool can download the data file's solution into a cache for later retrieval.


The offline editing tool follows appropriate security precautions to contain possibly dangerous code in a data file's solution even when the solution is installed from a local source, such as when a user is offline.  This offline editing tool
determines what level of security is appropriate for a data file's solution based on the original source of the solution. 

BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 illustrates a communications network and a system capable of implementing a method for offline editing of data files.


FIG. 2 illustrates an exemplary electronic form whereby a user can edit a data file.


FIG. 3 is a flow diagram of an exemplary process for editing of data files while online or offline.


FIG. 4 is a flow diagram of an exemplary process for offline editing of a data file with security by sandboxing the data file's solution application.


FIG. 5 is a block diagram of a computer system that is capable of supporting secure online and offline editing of data files.


The same numbers are used throughout the disclosure and figures to reference like components and features.


DETAILED DESCRIPTION


The following disclosure describes an easy, simple, and secure way to access data files when offline.  If a user has opened a data file first online, or if the system has otherwise received the data file's solution, a document manager application
can silently discover and deploy a data file's solution.  The document manager allows a user to simply select a data file to open and the document manager will open the data file with a discovered and deployed solution.  The user need not discover,
select, or even be aware that the data file requires a solution for the data file to be edited.  After selecting the data file to open, the user can then edit and access the data file in a way very similar to how it would act and appear had the user
opened the data file while online.


Data Files, Solutions, and Host Applications


Data files, their solutions, and a host application work together to allow a user to open and edit the data file.  Data files contain little or no operable code, where as a solution file containing presentation and logic applications.  Because
editing a data file requires a solution, if a user tries to open a data file without a solution, she could get a error, a prompt asking the user to open a solution, or perhaps a flat list of the data in the data file.


To view and edit a data file then, the data file's solution is needed.  A data file's solution application is one or more files that, when installed, are used to enable a user to view, access, and edit the data file.


In addition to the data file and its solution, a host application is needed.  This application works to enable the solution to function fully.  In this description, a document manager application is described, which is capable not only of acting
as a host application (allowing a solution to function properly), but can also allow a user to open a data file without actively finding and installing the data file's solution.


For discussion purposes, the system and method described herein are described in the context of a single computer, a communications network, a user-input device, and a single display screen.  These devices will be described first, followed by a
discussion of the techniques in which these and other devices can be used.


Exemplary Architecture


FIG. 1 shows an exemplary architecture 100 to facilitate online and offline editing of data files.  This architecture 100 includes a computing system 102 connected to a communications network 104.  The system 102 is configured to go online and
communicate via the communications network 104 to gain access to non-local information sources, such as sources on an intranet or global network.  Alternatively, the system 102 can remain offline, where it utilizes local resources without communicating
over the communications network 104.


The computing system 102 includes a user-input device 106, a display 108 having a screen 110, and a computer 112.  The user-input device 106 can include any device allowing a computer to receive a designer's preferences, such as a keyboard, a
mouse, a touch screen, voice-activated input device, a track ball, and the like.  With the user-input device 106, a user can edit a data file by adding or deleting information within a data-entry field on an electronic form, for instance.  The user can
use the display 108 and its screen 110 to view the data files.


The computer 112 includes a processing unit 114 to execute applications, a memory 116 containing applications and files, and a network interface 118 to facilitate communication with the communications network 104.  The memory 116 includes
volatile and non-volatile memory, and applications, such as an operating system 120 and a document manager application 122.  The memory 116 also includes a solution 124 for a data file 126.  The solution 124 is located locally in the memory 116, but
often has a different original source, such as a source on the communications network 104.  The solution 124 contains one or more files, such as a presentation file 128, logic file 130, and list file 132, which will be discussed in greater detail below.


The document manager application 122 facilitates offline editing of the data files 126 and is executed by the processing unit 114.  The document manager 122 is capable of acting as a host application and enabling a user to open the data file 126
without actively finding and installing the data file's solution 124.  Without any user interaction, other than the user attempting to open the data file 126, the document manager 122 discovers and installs the data file's solution 124.  Thus, the user
does not have to do anything but request to open the data file 126.  The user does not have to discover the data file's solution 124.  The user does not have to install the data file's solution 124.  This silent discovery and deployment allows the user
to view, edit, and otherwise interact with the data file 126 with just a single request.  In addition, the document manager 122 can provide security offline similar to the security that the user typically enjoys when running a solution online.


A view of the data file 126 is depicted on screen 110 through execution of the data file's solution 124.  The solution 124 contains one or more applications and/or files that the document manager 122 uses to enable a user to edit the data file
126.  To edit the data file 126 in a user-friendly way, the data file's solution 124 contains the presentation file 128, which includes an electronic form.  This presentation file 128 gives the user a graphical, visual representation of data-entry fields
showing previously entered data or blank data-entry fields into which the user can enter data.  Data files often have one solution but each solution often governs multiple data files.


FIG. 2 shows an electronic form 200 entitled "Purchase Order", which is generated by the solution 124.  This purchase order 200 contains data-entry fields in which a user can enter data.  These data-entry fields map to the data file 126, so that
the data entered into the form are retained in the data file 126.


This solution 124 presents an electronic form but also contains the logic file 130 that governs various aspects of the electronic form and the data file 126.  In a reference number data-entry field 202, for instance, the solution 124 presents the
data-entry field as a white box within a gray box, provides a description of the data desired with the text "Reference Number", and contains logic requiring that the user enter only numbers.  Thus, if the user attempted to enter letters, the logic file
130 of the solution 124 would not permit the user's entry.  The solution 124 could reject it and inform the user of the problem, such as with a sound, flashing error signal, pop-window, or the like.


The logic file 130 is employed in the solution 124 to ensure that the right kind of data is being entered and retained by the data file 126.  A user's business manager attempting to reference purchases with a reference number, for instance, would
like the solution 124 to have numbers in the reference number data-entry field 202; the manager may not be able to determine how an order should be handled if the reference number entered is incorrect because it contains letters.


Similarly, suppose a business manager wants the delivery date for delivery of a purchased product.  To require this, the logic file 130 of purchase order 200's solution 124 could be constructed to require a date to be entered into a date-required
data-entry field 204.  The logic file 130 can be internal to the solution 124, or can be implied from the data file 126 even if the data file 126 is primarily data.  The logic file 130 can also be a schema, such as an XML schema.


A solution can govern multiple data files.  The exemplary purchase order 200, for example, allows one or more users to fill out many different orders.  Each time a user fills out a purchase order form, the system 102 can create a separate data
file for that order.  Often, a user will create many different data files having the same solution.  For each data file edited after the first, the system 102 is likely to have the appropriate solution stored in the memory 116.  Thus, if a user
previously opened a first data file and later attempts to open a second data file, both of which utilize the purchase order 200 solution, the document manager 122 can silently discover and deploy the purchase order 200 solution to enable the user to edit
the second data file.  How the document manager 122 discovers and deploys solutions will be discussed in greater detail below.


A solution can be one file or contain many files, so long as the files used to edit data files it governs are included.  The solution 124 of FIG. 1 includes the listing file 132, which is a manifest of all of the other files in the solution 124
and contains information helping the document manager 122 to locate them.  The logic file 130 and presentation file 128 can be joined or separate.  The presentation file 128 helps the document manager 122 present or give a view of a form enabling entry
of data into the data file 126, such as a visual representation of the data file 126 by the purchase order 200 electronic form.  In some implementations, the presentation file is an XSLT file, which, when applied to an XML data file, generates a XHTML
(eXtensible Hyper-Text Markup Language) or HTML (Hyper-Text Markup Language) file.  XHTML and HTML files can be used to show a view on the screen 110, such as the purchase order 200 of FIG. 2.


A solution, such as the solution 124, can also include various files or compilations of files, including a manifest file setting forth names and locations for files that are part of the solution 124.  The files within the solution 124 can be
packaged together, or can be separate.  When separate, the list file 132 acts as a manifest of the files within the solution 124.  The list file 132 can also include other information, such as definitions, design time information, data source references,
and the like.  When the files are packaged together, the document manager 122 can simply install and execute the packaged solution file for a particular data file.  When not packaged, the document manager 122 can read the list file 132, find the listed
files, and install and execute each of the listed files for the particular data file.  The list file 132 and the packaged solution file can be interrelated in that an packaged file contains the list file 132 and the list file 132 lists files packaged
within the packaged file, although usually only one need be discovered by the system 102 to open a particular data file.


Like solutions, data files can come in various types and styles.  As mentioned above, data files can be written in XML or some other mark-up language, or can be written in other languages.  Most data files, however, do not contain extensive logic
and other files or code.  One of the benefits of having data files separate from their solutions, is that is makes the data within them easier to mine.  Because the data files are separate from their solution, the document manager 122 makes them easy to
open and edit by silently discovering and deploying the solution for the data file.


Data files also are typically concise and data-centered so that the data they contain can be more easily accessed or manipulated by multiple software applications, including software not typically used in a solution, such as an application that
searches for a particular type of data and compiles that data into a report.  A non-typical application, for example, could be one that compiles a report of all of the purchase orders required to be mailed by a certain date by searching through and
compiling the data entered into data files through the date required data-entry field 204 of the purchase order 200 electronic form.


The above devices and applications are merely representative, and other known devices and applications may be substituted for or added to those shown in FIG. 1.  One example of another known device that can be substituted for those shown in FIG.
1 is the device shown in FIG. 5.


Techniques for Silent Discovery and Deployment of Data File Solutions


Overview


FIG. 3 shows a process 300 for silently discovering and deploying a data file's solution.  The process 300 is illustrated as a series of blocks representing individual operations or acts performed by the architecture 100.  The process 300 may be
implemented in any suitable hardware, software, firmware, or combination thereof.  In the case of software and firmware, the process 300 represents a set of operations implemented as computer-executable instructions stored in memory and executable by one
or more processors.


Silent Discovery and Deployment


At block 302, the system 102 receives input from a user to open the data file 126.  The user may simply click on a icon representing the data file 126 or otherwise select the data file 126 after which the system 102 opens the data file 126.


At block 304, the system 102 discovers a solution identifier in the selected data file 126.  This assumes that the data file 126 is one in which the document manager 122 is capable of reading.  The document manager 122 can read data files created
at some previous time by the user's or another's document manager 122.  In one implementation, the document manager 122 can also read the data file 126 if it is created by another application that builds a solution identifier into the data file 126.


This solution identifier can give the system 102 an original source for the solution 124.  With an original source for the solution 124, the system 102 has one manner in which to help determine the proper security appropriate for the solution
124.  How the system 102 and the document manager 122 handle security for a solution 124 is set forth in greater detail below.


The solution identifier is typically a URL (Uniform Resource Locator) or URN (Uniform Resource Name), but can include other types of names and/or locators.  URLs give locations and URNs names of resources, such as the solution 124, which are
typically accessible through the communications network 104.  With the solution identifier, the system 102 can determine the original source for the solution 124 (where it first came from) and whether or not the system 102 has seen the solution 124
before.


In one implementation, the solution identifier is part of a processing instruction included within the data file 126.  This processing instruction is often part of data files and can include various instructions to host applications, such as the
document manager 122.  Processing instructions, while not strictly data, do not rise to the level of an applet or application typically included in a solution for a data file.  For data files written in XML, for instance, the processing instructions are
usually not written in XML, but rather are just a piece of information commonly included.  A processing instruction in an XML data file can look like "<? mso-infoPathSolution solutionVersion="1.0.0.3" PIVersion="1.0.0.0"
href="http://xdsp04-neten/MiladinP/Forms/template.xsn" ?>".  This processing instruction give the document manager 122 a solution identifier, which here gives the original source for the solution for the data file.  This solution identifier includes a
URL indicating that the original location for the solution is at a remote server accessible by accessing the communications network 104 through the network interface 118.


One of the advantages of the document manager 122 is that it enables a user to open the data file 126 without the user needing to discover the data file's solution 124, install the solution 124, or even know that the solution 124 exists.  This
system and method enables users to open data files simply and easily and in many cases enables them to edit a data file offline that they would otherwise not have been able to edit.


With the solution identifier, the system 102 computes a special name for the solution 124 (block 306).  This special name is designed to be a name easily found only by the document manager 122.  The special name, because it is computed and
findable by the document manager 122 but is not intended to be discoverable by other applications, allows for greater security in downloading possibly hostile solutions from the communications network 104.


In one implementation, the document manager 122 takes the solution identifier and computes a unique special name for the solution identifier.  This unique special name is repeatable; the next time the document manager 122 computes a unique
special name for the same solution identifier, the same unique special name will be created.  By so doing, the document manager 122 can find a previously downloaded solution by computing the unique, special name and then searching for the unique, special
name to determine if the solution is available locally for offline use (such as by having the solution stored in the memory 116).


In another implementation, the document manager 122 computes a unique special name by computing a hash, such as a Message Digest 5 hash (MD5 hash), of the solution identifier.  By computing a one-way hash of the solution identifier, the document
manager 122 creates a unique, special name that is a file of 128 bits from the digits of the solution identifier.  Because the file of the unique, special name is 128 bits long, it is very difficult for another application, such as one designed to damage
a computer or its files, to determine if the solution 124 is on the computer (cached or available offline) and access the solution 124.  With this hash-based special name, the document manager 122 provides additional security for the system 102.


The system 102 uses the special name, which corresponds to a solution identifier and thus the data file's solution 124, to search through locally accessible sources for the solution 124 (block 308).  The system 102 may, for instance, search files
and folders in the memory 116 of FIG. 1 for files and/or folders with the same name as the special name computed in the block 306.


When the Special Name is Found


If the system 102 finds the special name (i.e., the "Yes" branch from block 310) the solution 124 was saved earlier in the system 102 searched locally in the block 308.  Thus, when the special name is found, the system 102 knows that the solution
124 referred to in the data file (which the user is attempting to open) is accessible offline by the system 102.  The solution 124 is usually stored in the memory 116 but can be stored in other searchable, local sources that the system 102 does not have
to go online to find.


The solution 124, stored at the source and found using the special name, may not be current, however.  Because of this, the system 102 determines whether or not the system 102 is online or offline (block 312).  If online (i.e., the "Yes" branch
from block 312), the system 102 will attempt to determine whether or not a more up-to-date solution should be installed (discussed below); if offline, the system 102 will proceed to install the locally stored solution 124 (block 314).


If the Solution is Found and the System is Offline


If the solution 124 is found and the system 102 is offline, the system 102 proceeds to install the solution 124 from the memory 116 or another locally accessible source (block 314).


The system 102 installs the solution 124 silently in that the suer does not need to known that the solution 124 was discovered, found, or being installed.  Thus, the system 102 enables a user to edit the data file 126 when offline by silently
discovering and deploying the data file's solution 124.


In one implementation, the system 102 installs the solution 124 and then opens the data file 126 in such a manner as to mimic how the data file 126 would be opened had the user opened the data file 126 with the solution accessible online, such as
through opening the data file 126 with Microsoft.RTM.  Internet Explorer.RTM..  The system 102 does so to make opening and editing the data file 126 as comfortable for the user as possible, because many users are familiar with opening data files online. 
One possible difference, however, is that if the system 102 has a slow connection to the communications network 104, the document manager 122, by installing the solution 124 from a local source like the memory 116, may more quickly open the data file 126
than if the user were online.


Also in block 314, the document manager 122 can install the solution 124 for the selected data file with certain constraints for security, which will be discussed in greater detail as part of a process 400 of FIG. 4.


In block 316, the system 102 opens the data file 126 to enable the user to edit the data file 126.  One example of an opened data file (and solution) enabling edits is the purchase order 200 of FIG. 2.  In this example, the user is able to edit
the data file 126 by adding, deleting, or changing data in data entry fields (like the reference number data-entry field 202 and the date required data-entry field 204) even though offline.


Following the previous blocks, a user can easily open a data file offline without having to discover or deploy the data file's solution.  This enables users, for example, after first opening a solution online, to open a data file offline.  A user
can open a data file online and edit it by adding a reference number through the reference number data-entry field 202 of the purchase order 200 electronic form and then stop editing the data file (the data file would contain the added reference number
by the system 102 adding the reference number to the data file).  The user could then go offline, such as by taking his or her laptop on a business trip, and complete filling out the electronic form.  Or the user could send the partially filled-out data
file to another user to fill out the rest of the electronic form, which the other user could do so long as the other user's system contains a stored solution.  This flexibility allows users and businesses a greater ability to use information by keeping
data and solutions separate and by allowing offline use of data files.


If the Solution is Found and the System is Online


Assuming the system 102 finds the special name and the system is online, the system 102 will attempt to determine whether the current solution is the most recent version or a more up-to-date solution is available.  In block 318, the system 102
compares the time stamp of the stored solution 124 and the online solution.  Since the system 102 is online, it can access the solution (here we assume that the original origin of the solution 124 is from an online source).  If the solution identifier
from the data file 126 selected by the user contains a reference to the solution 124 being accessible online, the system 102 goes online to check whether or not the online solution is newer than the stored solution 124 (block 320).  In one
implementation, the system 102 compares the time stamp of the online solution with a time stamp on the stored solution 124.


If the online solution is not newer (i.e., the "No" branch from block 320), the system 102 proceeds to the block 314, installing the stored solution 124.  If the online solution is newer than the stored solution 124 (i.e., the "Yes" branch from
block 320), the system 102 either replaces the stored solution 124 with the online solution or otherwise updates the older, stored solution 124.


Downloading the Solution for Later Use


In block 322, the architecture 100 (or the system 102 by accessing the communications network 104) downloads a solution into a locally accessible source such as the memory 116.  The system 102 downloads this solution when the data file 126
selected by a user contains a solution identifier for a solution for which the system 102 does not have local access (such as it not being cached) or for which the system 102 has local access but the cached or stored version of the solution (the solution
124) is older than the online version.


In either case, the system 102 has already discovered the solution identifier for the solution and computed a special name for the solution.  The system 102 then downloads the solution from the online source and saves it into a folder named with
the special name (block 324).  If a solution already exists in that folder, the system 102 replaces it with the newer version or otherwise updates the currently cached solution.  The resulting new or updated version then being the solution 124.


In one implementation, the system 102 saves the solution to a unique location within the system 102's accessible memory.  The system 102 does so in cases where the system 102 is used by multiple users.  By so doing, the system 102 is able to
determine which of the users that use the system 102 or load files into memory locally accessible by the system 102 saved the particular solution.  Also by so doing, the system 102 may provide greater security for the computer 112 and its users.


Techniques for Secure Deployment of Data File Solutions


FIG. 4 shows a process 400 for making deployment of data file solutions more secure.  The process 400 is illustrated as a series of blocks representing individual operations or acts performed by the system 102.  The process 400 may be implemented
in any suitable hardware, software, firmware, or combination thereof.  In the case of software and firmware, the process 400 represents a set of operations implemented as computer-executable instructions stored in memory and executable by one or more
processors.


Through the process 300, discussed above, the system 102 enables a user to open and edit a data file by silently discovering and deploying the data file's solution.  In the process 400, the system 102 acts to protect the user from the solution
because some solutions contain dangerous code, like viruses and worms.  To help prevent dangerous code from damaging the user's files and/or computer, the system 102 sandboxes the solution, if appropriate.


As part of this security, the system 102 can be configured to ask a user during an attempt to open a data file how the user wants to sandbox the data file's solution.  Many users, however, often do not know what level of sandboxing to chose, and
thus the explicit prompting slows the process and consumes unnecessary user time.


To make opening and editing a data file as easy as possible and because many users do not know what level of sandboxing a solution should be run within, the system 102 can be configured to sandbox a solution automatically, as set forth in FIG. 4
and the process 400 below.


In block 402, the system 102 determines the origin of a solution, such as the solution 124 of FIG. 1.  The system 102, from block 304, discovered the solution identifier from the data file 126.  With this solution identifier, the system 102 can
determine the origin of the solution 124.


The solution identifier can be a URL, a URN, or another Uniform Resource Identifier (URI).  URLs give a location for a solution and URNs a name, either of which can be used to locate and find the source of a solution.  URLs usually indicate a
non-local, online source for a solution like a remote server accessible through the communications network 104.  URNs give the name of a solution, which typically can be accessed online (but could be accessed from a local, offline source), and are less
subject to change by those in control of the solution.  In either case, these solution identifiers give the system 102 the original source of the solution.  The solution may be cached or otherwise stored by the system 102 in a local source (such as the
solution 124 in the memory 116), but the local source is not indicated as the solution's origin by the solution's solution identifier, the local source is a new source.


With the origin of the solution known, the document manager 122 sets the appropriate level of security for the solution 124, sandboxing the solution 124 based on its origin (block 404).  The document manager 122 sandboxes the solution 124, if
from unknown or untrustworthy sources on the global internet with a sandbox allowing the solution 124 very little leeway in the operations it can perform, such as reading or altering other files on the computer 112.  Greater trust, and so a weaker
sandbox, are used for the solution 124 if it has an origin from known and more trustworthy sources accessed remotely, such as from MSN.com or a company intranet source.  Very high trust, requiring a weak or no sandbox, is used for the solution 124 if is
has an origin on the computer 112, such as when the user or another person using the user's computer created the solution 124.


Setting security levels and appropriate use of sandboxes for online use of solutions for data files are performed by various internet-capable host applications.  The document manager 122, however, opens solutions and sandboxes them based on their
origin even when the solution is opened from a local source that differs from the original origin of the solution.  Typically, internet-capable host applications, such as Internet Explorer.RTM., will not open a solution from a local source silently, but
will return an error if the online copy is not available.  The document manager 122, however, opens and executes, without user interaction, solutions in appropriate sandboxes even when a solution is loaded from a local source.


In block 406, the system 102 installs the solution 124 within an appropriate sandbox.  This appropriate sandbox limits the operations that the solution 124 can perform, thereby helping to protect the computer 112 and its files from the solution
124.


A Computer System


FIG. 5 shows an exemplary computer system that can be used to implement the processes described herein.  Computer 542 includes one or more processors or processing units 544, a system memory 546, and a bus 548 that couples various system
components including the system memory 546 to processors 544.  The bus 548 represents one or more of any of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, and a processor or
local bus using any of a variety of bus architectures.  The system memory 546 includes read only memory (ROM) 550 and random access memory (RAM) 552.  A basic input/output system (BIOS) 554, containing the basic routines that help to transfer information
between elements within computer 542, such as during start-up, is stored in ROM 550.


Computer 542 further includes a hard disk drive 556 for reading from and writing to a hard disk (not shown), a magnetic disk drive 558 for reading from and writing to a removable magnetic disk 560, and an optical disk drive 562 for reading from
or writing to a removable optical disk 564 such as a CD ROM or other optical media.  The hard disk drive 556, magnetic disk drive 558, and optical disk drive 562 are connected to the bus 548 by an SCSI interface 566 or some other appropriate interface. 
The drives and their associated computer-readable media provide nonvolatile storage of computer-readable instructions, data structures, program modules and other data for computer 542.  Although the exemplary environment described herein employs a hard
disk, a removable magnetic disk 560 and a removable optical disk 564, it should be appreciated by those skilled in the art that other types of computer-readable media which can store data that is accessible by a computer, such as magnetic cassettes,
flash memory cards, digital video disks, random access memories (RAMs), read only memories (ROMs), and the like, may also be used in the exemplary operating environment.


A number of program modules may be stored on the hard disk 556, magnetic disk 560, optical disk 564, ROM 550, or RAM 552, including an operating system 570, one or more application programs 572 (such as the document manager application 122),
other program modules 574, and program data 576.  A user may enter commands and information into computer 542 through input devices such as a keyboard 578 and a pointing device 580.  Other input devices (not shown) may include a microphone, joystick,
game pad, satellite dish, scanner, or the like.  These and other input devices are connected to the processing unit 544 through an interface 582 that is coupled to the bus 548.  A monitor 584 or other type of display device is also connected to the bus
548 via an interface, such as a video adapter 586.  In addition to the monitor, personal computers typically include other peripheral output devices (not shown) such as speakers and printers.


Computer 542 commonly operates in a networked environment using logical connections to one or more remote computers, such as a remote computer 588.  The remote computer 588 may be another personal computer, a server, a router, a network PC, a
peer device or other common network node, and typically includes many or all of the elements described above relative to computer 542.  The logical connections depicted in FIG. 5 include a local area network (LAN) 590 and a wide area network (WAN) 592. 
Such networking environments are commonplace in offices, enterprise-wide computer networks, intranets, and the Internet.


When used in a LAN networking environment, computer 542 is connected to the local network through a network interface or adapter 594.  When used in a WAN networking environment, computer 542 typically includes a modem 596 or other means for
establishing communications over the wide area network 592, such as the Internet.  The modem 596, which may be internal or external, is connected to the bus 548 via a serial port interface 568.  In a networked environment, program modules depicted
relative to the personal computer 542, or portions thereof, may be stored in the remote memory storage device.  It will be appreciated that the network connections shown are exemplary and other means of establishing a communications link between the
computers may be used.


Generally, the data processors of computer 542 are programmed by means of instructions stored at different times in the various computer-readable storage media of the computer.  Programs and operating systems are typically distributed, for
example, on floppy disks or CD-ROMs.  From there, they are installed or loaded into the secondary memory of a computer.  At execution, they are loaded at least partially into the computer's primary electronic memory.  The invention described herein
includes these and other various types of computer-readable storage media when such media contain instructions or programs for implementing the blocks described below in conjunction with a microprocessor or other data processor.  The invention also
includes the computer itself when programmed according to the methods and techniques described herein.


For purposes of illustration, programs and other executable program components such as the operating system are illustrated herein as discrete blocks, although it is recognized that such programs and components reside at various times in
different storage components of the computer, and are executed by the data processor(s) of the computer.


Conclusion


The above-described system and method enables a user to edit data files when offline by discovering and deploying the data file's solution application.  Although the invention has been described in language specific to structural features and/or
methodological acts, it is to be understood that the invention defined in the appended claims is not necessarily limited to the specific features or acts described.  Rather, the specific features and acts are disclosed as exemplary forms of implementing
the claimed invention.


* * * * *























				
DOCUMENT INFO
Description: BACKGROUNDExtensible markup language (XML) is increasingly becoming the preferred format for transferring data. XML is a tag-based hierarchical language that is extremely rich in terms of the data that it can be used to represent. For example, XML can beused to represent data spanning the spectrum from semi-structured data (such as one would find in a word processing document) to generally structured data (such as that which is contained in a table). XML is well-suited for many types of communicationincluding business-to-business and client-to-server communication. For more information on XML, XSLT, and XSD (schemas), the reader is referred to the following documents which are the work of, and available from the W3C (World Wide Web consortium): XMLSchema Part 2: Datatypes; XML Schema Part 1: Structures, and XSL Transformations (XSLT) Version 1.0; and XML 1.0 second edition specification.One of the reasons that data files written in XML are often preferred for transferring data is that XML data files contain data, rather than a combination of data and the software application needed to edit the data. One problem with XML datafiles, however, is that to edit an XML data file, a user needs to first install a solution software application used to access, view, and edit the data file.When a user is online, his computer can run a host application capable of accessing the Internet, such as Microsoft.RTM. Internet Explorer.RTM., which can silently discover and deploy an XSLT, which enables the user to author and access an XMLdata file.If a user wishes to save an XML data file for later, offline use, however, the user may encounter various problems. In some cases, a user wishing to reopen an XML data file offline will not be able to do so because he can no longer discover anddeploy the XML data file's solution application. The user can no longer discover a solution if he is no longer online and the solution is accessible only online. In other cases, a user can access