System and method for virtual folder sharing including utilization of static and dynamic lists

Description

FIELD OF THE INVENTION

The present invention relates to file systems, and more particularly, to a system and method for sharing virtual folders.

BACKGROUND OF THE INVENTION

The sharing of files and folders has always been a difficult task. In known systems, users are often limited to just sharing out entire folders. Users typically do not have the ability to share out individual files or items. In order to share files, a user has typically had to create a folder, organize the desired files in the folder, and then share the folder.

The sharing of files has further been complicated by the fact that users also have to deal with files being in different locations, such as on different devices, on other PCs, or online. Files coming from different locations are often organized differently, and not kept in the same fashion or place. As another example, files stored on a corporate network may inherently be separated from files a user has on a current machine. Users also have to keep track not only of what file data is stored, but where it is stored. For example, for music files, users are forced to keep copies on various systems and to try to track which music files are located where. This can make files difficult to locate, even when they are locally stored.

The sharing of files is also complicated by the fact that it is also sometimes difficult to find and return to files that a user has. A user may find it difficult to recall where and how they stored certain files. Given a set of folders and even a group of similar files, users often find it difficult to quickly find the one that they are looking for. For files stored in a difficult place to find, it is that much more complex to locate. It is also sometimes difficult for users to find or return to files on a network. Users typically have to memorize or map the various sites and names that they need for finding and sharing files on a network.

Organizing and sharing files is also complicated by the fact that name spaces may vary, which can cause confusion to the user as to what is “correct.” This is particularly true on a network where there are different naming conventions, limitations, and so on. For example, certain operating systems may require short names with no spaces in order for them to be visible. Programs also often save files to their own directory or other name spaces, which can make it difficult for users to find their way back to the files. Programs often have default directories and places they save documents. A user often has to search through their hard disk and make guesses about where a file is stored. Related items are also often stored in separate places. Related files that a user has may be stored on different parts of the hard disk, etc. This problem becomes more common with the developments of digital media services that have multiple content types (e.g., pictures, music, video).

The present invention is directed to providing a system and method that overcome the foregoing and other disadvantages. More specifically, the present invention is directed to a system and method for virtual folder sharing.

SUMMARY OF THE INVENTION

A system and method for virtual folder sharing, including utilization of static and dynamic lists is provided. The static and dynamic lists may be created as types of virtual folders. In accordance with one aspect of the present invention, a user is able to construct a query, find items, and then share the items with other users. The user is provided with the option to share just the items that were located by the query (a static list) or else to share the located items plus other items that meet the criteria in the future (a dynamic list). These types of lists utilize properties of virtual folders which expose items to users in different views based on their metadata instead of the actual physical underlying file system structure on the disk.

In accordance with another aspect of the invention, a static list comprises a folder of items that are in a specific order and that can optionally have annotations placed on each item. These annotations are not part of the item, but belong to the actual list. Some examples of a static list are a shopping list, a music play list, and a slide show of pictures. In accordance with the present invention, a user is able to share the static list with other users. When the static list is shared, the actual static list is left in place on the sharer's machine or server, while permission is granted to the sharees to access the list and referenced items. The permissions that are granted are determined by what the sharer specifies at the sharing time. For example, the sharer can decide to share out the list to the sharee with just read or read-write access, etc. In the case that the sharer cannot grant permission to the items (since the sharer does not have permission themselves to do this operation) then the sharer is notified at the sharing time that the sharee may not be able to access that item. At the conclusion of the process, the sharee is able to remotely access the list and its referenced items from the sharer's computer. If the sharer later changes the list by adding or removing items, these items are also automatically repermissioned to allow or disallow the sharee's access to the items. In one embodiment, it is also possible to dynamically repermission items as they come and go from the static list, since the actual definition of the static list lives in the database which can be monitored as it changes.

In accordance with another aspect of the invention, a dynamic list comprises a set of items based on a scope plus a set of criteria. For example, a user may create a query with a scope defined as all of the data storage on a local machine, and a criteria of author=X. Once the user has a dynamic list, it can be shared out. When the user shares a dynamic list, the following operations are carried out. An initial determination is made as to whether the user wants to share just the items that are currently in the dynamic list at that time, or else any items that come and go from the dynamic list in the future. If the user wants to share just the items that currently exist in the dynamic list, then a static list representing what is in the dynamic list is generated and that static list is shared. If the user instead wants to share out the true dynamic list, then all of the items that meet the criteria of the dynamic list are shared. This means the items are left in place on the machine where the sharing is occurring and the items are permissioned to allow the sharee to have access to the items. In the case that the sharer cannot grant permission to the items (e.g., the sharer does not have permission themselves to do this operation) then the sharer is notified at the time of the sharing that the sharee may not be able to access the items. At the conclusion of the process, the sharee is able to remotely access the list and its referenced items from the sharer's computer. If any items in the dynamic list have their properties changed such that they no longer meet the criteria of the dynamic list, then these items are appropriately re-permissioned. In the same way, if any items that do not belong to the dynamic list change such that they fall into the scope and meet the criteria of the dynamic list, they are also re-permissioned to grant access to the users with which the dynamic list is shared.

BRIEF DESCRIPTION OF THE DRAWINGS

The foregoing aspects and many of the attendant advantages of this invention will become more readily appreciated as the same become better understood by reference to the following detailed description, when taken in conjunction with the accompanying drawings, wherein:

FIG. 1 is a block diagram of a general purpose computer system suitable for implementing the present invention;

FIG. 2 is a block diagram of a virtual folder system in accordance with the present invention;

FIG. 3 is a flow diagram illustrative of a routine by which a user provides a query that draws back selected files and folders;

FIG. 4 is a flow diagram illustrative of a routine by which virtual folders are constructed and displayed on the screen in accordance with either a default query or a query from the user;

FIG. 5 is a tree diagram of a folder structure in accordance with a physical folder arrangement on a hard drive;

FIG. 6 is a tree diagram of a virtual folder structure;

FIG. 7 is a tree diagram of the virtual folder structure of FIG. 6, wherein the clients stack is further filtered by contracts and year;

FIG. 8 is a tree diagram of the virtual folder structure of FIG. 7, wherein the contracts of the clients stack are further filtered by year;

FIG. 9 is a tree diagram of the virtual folder structure of FIG. 6, wherein the contracts stack is further filtered by clients and year, of which the clients are still further filtered by year;

FIG. 10 is a diagram illustrative of a screen display showing the stacks of a document library;

FIG. 11 is a diagram illustrative of a screen display showing the documents in the ABC Corp. stack of FIG. 10;

FIG. 12 is a diagram illustrative of a screen display in which a stacking function is selected for the documents of FIG. 11;

FIG. 13 is a diagram illustrative of a screen display in which a “stack by author” parameter is selected for the stacking function of FIG. 12;

FIG. 14 is a diagram illustrative of a screen display in which the files of FIG. 13 have been stacked by author;

FIG. 15 is a diagram illustrative of a screen display in which a stacking function is selected and a “stack by category” option is further selected for restacking the files of FIG. 14;

FIG. 16 is a diagram illustrative of a screen display in which the files of FIG. 14 have been restacked by category;

FIG. 17 is a diagram illustrative of a screen display in which a quick link for showing physical folders is selected;

FIG. 18 is a diagram illustrative of a screen display in which the physical folders are shown which contain the files of the virtual folder stacks of FIG. 17;

FIG. 19 is a flow diagram illustrative of a routine by which a user can directly manipulate virtual folders;

FIG. 20 is a diagram illustrative of a screen display in which a new “West Coast” stack has been added to the stacks of FIG. 10;

FIG. 21 is a diagram illustrative of a screen display in which direct manipulation is used for copying the files from the “ABC Corp.” stack to the “West Coast” stack of FIG. 20;

FIG. 22 is a flow diagram illustrative of a routine for the system dynamically generating new filter terms;

FIG. 23 is a flow diagram illustrative of a routine for the system filtering items based on the selection of a filter term;

FIG. 24 is a diagram illustrative of a screen display in which the stacks of FIG. 10 have been filtered by the term “AB”;

FIG. 25 is a diagram illustrative of a screen display in which the stacks of FIG. 10 have been filtered by the term “ABC”;

FIG. 26 is a diagram illustrative of a screen display in which the filter term “year 2002” is selected for the stacks of FIG. 10;

FIG. 27 is a diagram illustrative of a screen display in which the stacks of FIG. 10 have been filtered by the “year 2002” and the further selection of the filter term “month”;

FIG. 28 is a diagram illustrative of a screen display in which a list is presented for selecting a month for filtering;

FIG. 29 is a diagram illustrative of a screen display wherein the stacks of FIG. 10 have been further filtered by the month of January, and further showing a filter term of “day”;

FIG. 30 is a flow diagram illustrative of a routine for creating a new quick link;

FIG. 31 is a diagram illustrative of a screen display for creating a new quick link called “January Work” based on the filtering of FIG. 29;

FIG. 32 is a diagram illustrative of a screen display in which a quick link of “All Authors” is selected;

FIG. 33 is a diagram illustrative of a screen display in which a list of all of the authors of FIG. 32 is presented;

FIG. 34 is a diagram illustrative of a screen display in which “Author 1” has been selected from the list of FIG. 33 and all of the Author 1's documents are shown;

FIG. 35 is a flow diagram illustrative of a routine for creating a new library;

FIG. 36 is a diagram illustrative of a screen display in which a collection of various available libraries are shown;

FIG. 37 is a flow diagram illustrative of a routine for defining the scope of a virtual folder collection;

FIG. 38 is a block diagram illustrative of the various sources which may form the scope of a virtual folder collection;

FIG. 39 is a flow diagram illustrative of a routine for including non-file items in a virtual folder collection;

FIG. 40 is a diagram illustrative of a screen display showing various non-file items included in a virtual folder;

FIG. 41 is a block diagram illustrative of a memory system including a static list and a set of referenced items;

FIG. 42 is a flow diagram illustrative of a routine for sharing a static list;

FIG. 43 is a flow diagram illustrative of a routine for re-permissioning items that are removed/added from a static list;

FIG. 44 is a flow diagram illustrative of a routine for creating a dynamic list;

FIG. 45 is a block diagram illustrative of a memory system including a dynamic list and a set of referenced items;

FIG. 46 is a flow diagram illustrative of a routine for sharing a dynamic list;

FIG. 47 is a flow diagram illustrative of a routine for re-permissioning items that are removed/added from a dynamic list;

FIG. 48 is a block diagram illustrative of a memory system including a dynamic list from which an item has been removed;

FIG. 49 is a block diagram illustrative of a memory system including a dynamic list to which items have been added;

FIG. 50 is a flow diagram illustrative of a routine for calling a list sharing API; and

FIGS. 51A to 51L are block diagrams illustrative of various implementations of a programming interface that may be utilized in a list sharing system.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT

A system and method for virtual folder sharing, including utilization of static and dynamic lists is provided. The static and dynamic lists may be created as types of virtual folders. Virtual folders utilize the same or similar user interfaces that are currently used for file systems. Virtual folders expose regular files and folders (also known as directories) to users in different views based on their metadata instead of the actual physical underlying file system structure on the disk. Location-independent views are created which allow users to manipulate their files and folders utilizing similar controls as those presently used for managing file systems. In general, this means that users can organize and rearrange their files based on inherent properties in the files themselves, instead of the managing and organization being done as a separate part of the system. Virtual folders may represent files or items from different physical locations, such as from multiple disk drives within the same computer, between multiple computers, or different network locations, such that one view of files or items can expose files or items sitting at different physical locations. In one embodiment, the different items or files need only be connected via an IP network in order to be included.

The virtual folder modeling is also able to be used for traditionally non-file entities. An application of this is to have a set of user interfaces similar to files and folders (that is, objects and containers) to show traditionally non-file entities. One example of such non-file entities would be e-mails, while another would be contact information from a contact database. In this manner, virtual folders provide for a location-independent, metadata-based view system that works regardless of whether the data being shown is from files or non-file entities. In general, these aspects allow more flexibility in terms of letting users manipulate their files and data, using both common user interface techniques (drag and drop, double-click, etc.) as well as leveraging the rich integration of various data types.

FIG. 1 and the following discussion are intended to provide a brief, general description of a suitable computing environment in which the present invention may be implemented. Although not required, the invention will be described in the general context of computer-executable instructions, such as program modules, being executed by a personal computer. Generally, program modules include routines, programs, characters, components, data structures, etc., that perform particular tasks or implement particular abstract data types. As those skilled in the art will appreciate, the invention may be practiced with other computer system configurations, including hand-held devices, multiprocessor systems, microprocessor-based or programmable consumer electronics, network PCs, minicomputers, mainframe computers, and the like. The invention may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote memory storage devices.

With reference to FIG. 1, an exemplary system for implementing the invention includes a general purpose computing device in the form of a conventional personal computer 20, including a processing unit 21, system memory 22, and a system bus 23 that couples various system components including the system memory 22 to the processing unit 21. The system bus 23 may be any of several types of bus structures including a memory bus or memory controller, a peripheral bus, and a local bus using any of a variety of bus architectures. The system memory includes read-only memory (ROM) 24 and random access memory (RAM) 25. A basic input/output system (BIOS) 26, containing the basic routines that helps to transfer information between elements within the personal computer 20, such as during start-up, is stored in ROM 24. The personal computer 20 further includes a hard disk drive 27 for reading from or writing to a hard disk 39, a magnetic disk drive 28 for reading from or writing to a removable magnetic disk 29, and an optical disk drive 30 for reading from or writing to a removable optical disk 31, such as a CD-ROM or other optical media. The hard disk drive 27, magnetic disk drive 28, and optical disk drive 30 are connected to the system bus 23 by a hard disk drive interface 32, a magnetic disk drive interface 33, and an optical drive interface 34, respectively. The drives and their associated computer-readable media provide non-volatile storage of computer-readable instructions, data structures, program modules, and other data for the personal computer 20. Although the exemplary environment described herein employs a hard disk 39, a removable magnetic disk 29, and a removable optical disk 31, 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, Bernoulli cartridges, 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 39, magnetic disk 29, optical disk 31, ROM 24 or RAM 25, including an operating system 35, one or more application programs 36, other program modules 37 and program data 38. A user may enter commands and information into the personal computer 20 through input devices such as a keyboard 40 and pointing device 42. Other input devices (not shown) may include a microphone, joystick, game pad, satellite dish, scanner, or the like. These and other input devices are often connected to the processing unit 21 through a serial port interface 46 that is coupled to the system bus 23, but may also be connected by other interfaces, such as a parallel port, game port or a universal serial bus (USB). A display in the form of a monitor 47 is also connected to the system bus 23 via an interface, such as a video card or adapter 48. One or more speakers 57 may also be connected to the system bus 23 via an interface, such as an audio adapter 56. In addition to the display and speakers, personal computers typically include other peripheral output devices (not shown), such as printers.

The personal computer 20 may operate in a networked environment using logical connections to one or more personal computers, such as a remote computer 49. The remote computer 49 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 the personal computer 20. The logical connections depicted in FIG. 1 include a local area network (LAN) 51 and a wide area network (WAN) 52. Such networking environments are commonplace in offices, enterprise-wide computer networks, intranets, and the Internet.

When used in a LAN networking environment, the personal computer 20 is connected to the local area network 51 through a network interface or adapter 53. When used in a WAN networking environment, the personal computer 20 typically includes a modem 54 or other means for establishing communications over the wide area network 52, such as the Internet. The modem 54, which may be internal or external, is connected to the system bus 23 via the serial port interface 46. In a networked environment, program modules depicted relative to the personal computer 20 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.

As implemented on a system of the type illustrated in FIG. 1, the present invention utilizes virtual folders which make it easier for users to share files and to perform basic tasks around file manipulation and folder navigation (browsing) and to provide higher level storage capabilities which can be leveraged in new features. The virtual folders expose files and items to users in different views based on their metadata instead of the actual physical underlying file system structure on the disk.

FIG. 2 is a block diagram of a virtual folder system 200 in accordance with the present invention. As will be described in more detail below, the virtual folders allow a user to change the “pivot” which controls the way the data is viewed. As an example, a user could view their music as a flat list of all the songs, which can be grouped by album. Alternatively, the user could switch the view to show only the genres or artists or years, etc. The user can tailor the view to see only the objects suited to the task at hand. This allows an improved browsing experience that negates the need for further navigation through folders (both down and back up). The same lessons and capabilities apply to modeling other data-types not stored as files. Contacts, for example, can be exposed to the user in this way, giving them familiar interface capabilities, as well as richer infrastructure for manipulating them than is provided by a flat address book.

As illustrated in FIG. 2, the virtual folder system 200 includes a folder processor 210, a relational database 230, a virtual folder descriptions database 232, an other shell folders component 234, a folder handler's component 236, and a shell browser and view component 240. The folder processor 210 includes a native handling code component 212, a handler factory component 214, a property writer component 216, a rowset parser component 218, a query builder component 220, an enumerator component 222, and a property factory component 224.

The relational database 230 stores properties about all files in the system. It also stores some items, like contacts (i.e., non-file items), entirely. In general, it stores metadata about the types of files and items that it contains. The relational database 230 receives SQL queries from the query builder 220. The relational database 230 also sends SQL roasts to the rowset parser component 218, with one row per item column, columns being the item properties.

The virtual folder descriptions database 232 includes the virtual folder descriptions. The virtual folder descriptions database 232 sends data to the query builder component 220, including a list of types to display in the folder, the initial filter, and the physical locations to show results from (the scopes).

With regard to the other shell folders component 234, the folder processor 210 delegates to existing shell folders from many types of items, including all files, for handlers or properties. The other shell folders component 234 sends properties from other folders to the property factory 224. The other shell folders component also sends handlers to the handler factory 214.

The folder handlers component 236 provides code behavior for the items that exist only in the database, like contacts. This is what allows non-file items to behave akin to files. The folder handlers component 236 sends handlers to the handler factory 214.

For the native handling code component 212, the folder processor 210 directly implements certain handlers based on the properties of the items. The native handling code component 212 sends handlers to the handler factory 214. For the native handling code component 212 and the folder handlers component 236, like all namespaces, virtual folders have to provide a set of handlers (context menu, icon, thumbnail, infotip, . . . ) for their items. For most of these (infotip, data object, drag-drop handler, background context menu . . . ) the virtual folder provides a common (native) handler for all the types it holds. However there are others which the author of the type has to provide (context menu on the item itself, writable property store, . . .). The default handler can also be overridden. Virtual folders reuse this for files and allow non-file items do the same.

The handler factory 214 takes ID lists and produces code behaviors that provide context menus, icons, etc. In general, the folder processor 210 may use native handlers, external handlers, or delegate to other shell folders to get handlers, as described above with respect to the native handling code component 212, the other shell folders component 234, and the folder handlers component 236. The handler factory component 214 sends handlers to the shell browser in view 240, as requested by the view. The handler factory component 214 sends a property handler to the property writer 216.

The property writer 216 converts user intentions such as cut, copy, and paste into property rights to the file or item. A shell browser and view component 240 sends data to the property writer 216, including direct manipulation (cut/copy/paste) or editing of metadata. In general, since virtual folders present an organization based on the properties of an item, operations such as move and copy (drag-drop) become an edit on those properties. For example, moving a document, in a view stacked by author, from Author 1 to Author 2, means changing the author. The property writer component 216 implements this function.

The rowset parser 218 takes database rowsets and stores all item properties into a shell ID list structure. A rowset takes the piecewise definition of the virtual folder and builds a SQL string which can then be issued to the database. The rowset parser component 218 sends ID lists to the enumerator component 222. As described above, the rowset parser component 218 also receives data from the relational database 230, including SQL rowsets, with one row per item, the columns being item properties.

The query builder component 220 builds SQL queries. The query builder component 220 receives data from the enumerator component 222, including new filters from the navigation. The query builder component 220 also receives data from the virtual folder descriptions database 232, including a list of the types to display in the folder, the initial filter, and the physical location to show results from (the scopes). The query builder component 220 sends the SQL queries to the relational database 230.

In general, the query builder component 220 includes a set of rows (in other words a table). This is what running the query yields. The rowset parser component 218 takes each row and using the column names transforms the row into an ID list. An ID list is a well-known shell structure which is used to reference items in a namespace. Doing this allows virtual folders to be just like any other namespace to the rest of the shell. Also caching this data helps keep database access, which can be costly, to a minimum.

The enumerator component 222 operates in response to a navigation to a virtual folder. As described above, the enumerator component 222 receives ID lists from the rowset parser component 218, and sends new filters from the navigation to the query builder component 220. The enumerator 222 also sends data to the shell browser and view component 240, including ID lists that are returned to be inserted into the view after a navigation.

The property factory component 224 takes ID lists and property identifiers and returns values for those properties. The property factory component 224 receives data from the handler factory component 214 including the property handler. As described above, the property factory component 224 also receives data from the other shell folders component 234, including properties from other folders. The property factory component 224 also sends data to the shell browser and view component 240, including item properties, as requested by the view.

The shell browser and view component 240 displays the contents of a folder in a window, and handles all the user interaction with the displayed files or items, such as clicking, dragging, and navigating. Thus, the shell browser and view component 240 receives the user actions. The shell browser and view component 240 also gets the data regarding the code behaviors that it needs from the folder, in this case the folder processor 210.

As described above, the virtual folders expose regular files and folders (also known as directories) to users in different views based on their metadata instead of the actual physical underlying file system structure on the disk. Thus, the system is able to take a property that is stored in the database and represent it as a container that is like a folder. Since users are already familiar with working with folders, by presenting the virtual folders in a similar manner, users can adapt to the new system more quickly.

FIG. 3 is a flow diagram illustrative of a routine 300 by which a user provides a query that draws back selected items. At a block 302, the folder processor gets a query from the user. In a block 304, the folder processor passes the query to the relational database. At a block 306, the relational database provides the results back to the folder processor. At block 308, the folder processor provides the results to the user in the form of virtual folders and items.

FIG. 4 is a flow diagram illustrative of a routine 320 by which virtual folders are constructed and displayed on the screen in accordance with either a default query or a query from the user. At a block 322, when a user first opens the virtual folder, a default query is used. This default query is taken from the registry. For example, the default query for a music library could be to show all the songs grouped by album. At a block 324, the folder processor constructs a query object for this query, and then passes this query to the relational database. At a block 326, the relational database generates the results of the query and passes these back to the folder processor as database rows and columns.

At a block 328, the folder processor takes these results and converts them from the rows and columns of data into an enumerator structure, which is used by the folder view to populate the screen with the resulting virtual folders and items for the user to interact upon. At a decision block 330, a user decides whether to change the view (by issuing a different query or “pivot”). For example, a user could issue a “show all artists” pivot. If the user does want to change the view, then the routine returns to block 324 where the folder processor passes this new query to the relational database, and receives back new rows and columns of results, and constructs a new enumerator structure. The process then continues as described above, as the folder view clears and updates, using the enumerator to draw the “artist” objects to the screen.

In one example, album objects are provided that represent containers that users can navigate into. For example, double-clicking the “Beatles” albums will navigate the view to see all of the Beatles' songs. The folder processor issues the “show all Beatles' songs” query to the relational database, which hands back the rows and columns of data for those songs. The folder processor creates an enumerator of all these songs, which then get drawn to the screen.

The user can also choose the view at any point while browsing virtual folders. From the above example, after narrowing down to just show Beatles songs, a user can change the view to only show the songs as albums. The process of changing the view of items into another representation is called “stacking”. This is because the items are conceptually arranged into “stacks” based on that representation. In this case, the songs are rearranged into stacks for each of the various albums. Users can then navigate into one of these stacks, only seeing the songs from that particular album. Again, the user can rearrange the view of these remaining songs into stacks based on a property (e.g., a rating, for example). If the rating property were selected, the songs from that Beatles album would be shown in stacks for a one-, two-, or a three-star rating.

The results of each query depend on which physical locations are included in the scope. For example, the scope may be made to include only the folders in the user's “my documents” folder. Alternatively, the scope could include all folders on the computer, or even all folders on multiple network connected computers. The user is able to view and change the scope through a scope property sheet. In one example, the scope property sheet could be exposed by right-clicking on the virtual folder and choosing “properties.” The user could add new folders to the scope, or remove folders that were previously added.

One group of users for which virtual folders will provide particular utility is knowledge workers. Virtual folders allow knowledge workers to easily switch between viewing documents by file type, project, case number, author, etc. Since knowledge workers each tend to have a different method for organizing documents, virtual folders can be used to accommodate these different preferences.

FIG. 5 is a tree diagram of a folder structure in accordance with a physical folder arrangement on a hard drive. This physical folder arrangement is based on the traditional implementation of folders, which may be based on NTFS or other existing file systems. Such folders are referred to as physical folders because their structuring is based on the actual physical underlying file system structure on the disk. As will be described in more detail below, this is in contrast to virtual folders, which create location-independent views that allow users to manipulate files and folders in ways that are similar to those currently used for manipulating physical folders.

As illustrated in FIG. 5, a folder 400 is a “my documents” folder. At a first level, the folder 400 includes folders 410, 420, and 430, corresponding to Clients 1, 2, and 3, respectively. At a second level, each of the folders 410, 420, and 430 contain a folder 411, 421, and 431, respectively, which each correspond to the contracts for the selected client. At a third level, each of the folders 411, 421, and 431 contains a folder 412, 422, and 432, respectively, each corresponding to the year 2001. At the third level, each of the folders 411, 421, and 431 also contains a folder 413, 423, and 433, respectively, each corresponding to the year 2002.

It will be appreciated that a number of obstacles are presented to a user who wishes to navigate a physical folder file structure such as that illustrated in FIG. 5. For example, if the user wishes to work with all of the contracts that the user has produced, the user will first need to navigate to the folder 411 to work with the contracts for Client 1, and then will have to renavigate to the folder 421 to reach the contracts for Client 2, and will again have to renavigate to the folder 431 for the contracts for Client 3. This arrangement makes it difficult for the user to access all of the contracts, and in general prevents simultaneous viewing and manipulation of all of the contracts. Similarly, if the user wishes to view all of the contracts produced in the year 2001, the user will have to navigate and renavigate to the folders 412, 422, and 432, respectively. As will be described in more detail below, the virtual folders of the present invention provide an improved file system structure.

FIG. 6 is a tree diagram of a virtual folder structure. As will be described in more detail below, virtual folders create location-independent views that allow users to manipulate their files and folders in convenient ways. As shown in FIG. 6, the virtual folders are represented as stacks. A virtual folder 500 is an “all items” folder. At a first level, the virtual folder 500 contains virtual folders 510, 520, and 530, corresponding to clients, contracts, and year, respectively. As will be described in more detail below, this structure allows a user to access files according to a desired parameter.

FIG. 7 is a tree diagram of the virtual folder structure of FIG. 6, wherein at a second level, the virtual folder 510 further includes virtual folders 511 and 512, which correspond to contracts and year, respectively. In other words, the clients stack of virtual folder 510 is further filtered by contracts and year. The process for determining which files and items are contained in each of the virtual folders will be described in more detail below.

FIG. 8 is a tree diagram of the virtual folder structure of FIG. 7, wherein at a third level, the virtual folder 511 contains a virtual folder 513, which corresponds to a year. In other words, the contracts stack of virtual folder 511 is further filtered by year. While the virtual folder structure for the virtual folders 510, 511, and 513 have been structured according to clients, contracts, and year, it will be appreciated that the virtual folders allow for other structuring sequences to occur, as will be described in more detail below with reference to FIG. 9.

FIG. 9 is a tree diagram of the virtual folder structure of FIG. 6, wherein at a second level, the virtual folder 520 has been further filtered into virtual folders 521 and 522, corresponding to clients and year. At a third level, the virtual folder 521 has further been filtered to a virtual folder 523, corresponding to a year. The contrast between the organizational structures of FIGS. 8 and 9 helps illustrate the flexibility of the virtual 25 folder system. In other words, in a virtual folder system, a user is able to navigate the virtual folders according to desired parameters, as opposed to being dependent on the location-dependent views of a physical file structure such as that illustrated in FIG. 5.

FIG. 10 is a diagram illustrative of a screen display 600 showing the stacks of a document library. As noted above, stacks can be used to represent a type of virtual folder. As will be described in more detail below, the screen display 600 includes quick link elements 610-613, further elements 620-626, activity elements 630-633, information and control elements 640-645, and virtual folder stacks 651-655.

The quick link elements include an “all categories” quick link 610, on “all authors” quick link 611, a “January work” quick link 612, and a selection for displaying additional quick links 613. As will be described in more detail below, quick links can be selected by a user to perform desired navigations of the virtual folders. Quick links may be provided by the system, and some quick links may be created and saved by a user.

The filter elements include a “filter by” indicator 620, an entry blank 621, a “by date” indicator 622, a “year” selector 623, a “pick an author” selector 624, a “pick a category” selector 625, and a “more filters” selector 626. The “filter by” indicator 620 directs a user to the fact that the items below can be used to filter the virtual folders or items. The entry blank 621 provides an area in which a user can type a desired new filter term. The “by date” indicator 622 directs a user to the fact that by selecting a date from the “year” selector 623, the virtual folders or items can be filtered by the selected year. The “pick an author” selector 624 allows a user to filter according to a specific author. The “pick a category” selector 625 allows a user to filter according to a selected category. The “more filters” selector 626 allows a user to pull up additional filters on the display.

The activity selectors include a “create a new category” selector 630, “activity” selectors 631 and 632, and a “more activities” selector 633. As will be described in more detail below, the activities that are presented may be for generally desirable functions, or may more specifically be directed to activities useful for the type of virtual folders that are currently being displayed. For example, the “create a new category” selector 630 can be selected by the user to create a new category which will be represented by a new stack.

As noted above, the activity selectors 631 and 632 may be more specifically directed to the type of folders or items that are being displayed. For example, the present display is of a document library, for which the “activity” selectors 631 and 632 may be directed to activities specifically tailored for documents, such as editing or creating attachments. If the present library had been a photo library, the “activity” selector 631 and 632 could be for activities specifically directed to photos, such as forming photo albums or sharing photos with other users.

The information and control elements include information lines 640 and 641, a control line 642, a backspace control 643, and information lines 644 and 645. The information lines 640 and 641 provide information as to the current navigation of the virtual folders or items. In the present example, the information line 640 indicates that the current navigation is to a document library, while the information line 641 indicates the more complete navigation, showing that the document library is within the storage area. The control line 642 provides a number of standard controls, and the backspace button 643 allows a user to back up through a navigation. The information line 644 provides numerical information about the contents of the present navigation. In the present example, the information line 644 indicates that there are 41 items which take up 100 MB in the stacks of the document library. The information line 645 is available to provide additional information, such as additional information about a file that is selected.

The stacks of the document library include an “ABC Corp.” stack 651, a “backups stack” 652, a “business plans” 'stack 653, an “XYZ Corp.” stack 654, and a “marketing reports” stack 655. The numbers on top of each of the stacks indicate how many items are in each stack. For example, the “ABC Corp.” stack 651 is shown to include 8 items. The total number of items of the stacks adds up to the number of items indicated in the information line 644, which as described above is 41 in the present example. A selection box SB is provided which can be utilized by a user to select a desired item. The selection of the “ABC Corp.” stack 651 yields a view of the items of that stack, as will be described below with respect to FIG. 11.

FIG. 11 is a diagram illustrative of a screen display showing the items in the “ABC Corp.” stack 651 of FIG. 10. It should be noted that the information lines 640 and 641 now indicate that the present navigation is showing the “ABC Corp.” stack. The “ABC Corp.” stack 651 is shown to include 8 documents 751-758, corresponding to documents 1-8, respectively. The information line 644 correspondingly indicates that there are 8 items which take up 20 MB of memory. Documents of FIG. 11 may be further arranged into stacks within the ABC Corp. stack. In other words, within the virtual folder represented by the ABC Corp. stack 651, additional virtual folders may be organized to hold the documents, as will be described below with respect to FIGS. 12-16.

FIG. 12 is a diagram illustrative of a screen display in which a stacking function is selected for the documents of FIG. 1l. As shown in FIG. 12, the user is able to pull up a function box 760. The function box 760 includes a “view” selection 761, an “arrange icons by” selection 762, a “stacks” selection 763, a “refresh” selection 764, an “open containing folders” selection 765, a “cut” selection 766, a “copy” selection 767, an “undo” selection 768, a “new” selection 769, and a “properties” selection 770. The selection box SB is shown to be around the “stacks” selection 763.

FIG. 13 is a diagram illustrative of a screen display in which a “stack by author” parameter is selected for the stacking function of FIG. 12. As shown in FIG. 13, a box 780 is displayed which presents various stacking options. The stacking options include an “unstack” option 781, a “stack by category” option 782, a “stack by author” option 783, and a “stack by a user” option 784. The selection box SB is shown to be around the “stack by author” option 783.

FIG. 14 is a diagram illustrative of a screen display in which the files of FIG. 13 have been stacked by author. As shown in FIG. 14, stacks 791 and 792 correspond to authors Bob and Lisa, respectively. As indicated by the numbers on top of each of the stacks, the Bob stack 791 includes two items, while the Lisa stack 792 includes five items. The item 758 (corresponding to document 8) did not have an author, and so is not included in an “author” stack. The stacks 791 and 792 illustrate that stacks may be organized at multiple levels, such as within the “ABC Corp.” stack 651. Thus, the virtual folders may be formed at multiple levels, such as the “Lisa” stack 792 being within the “ABC Corp.” stack 651 which is within the document library.

FIG. 15 is a diagram illustrative of a screen display in which a “stack by category” option is further selected for restacking the files of FIG. 14. As shown in FIG. 15, the selection box SB is around the “stack by category” option 782. Since some of the items are already stacked in the stacks 791 and 792, the selection of the “stack by category” option 782 will restack the items, as will be described in more detail below with reference to FIG. 16.

FIG. 16 is a diagram illustrative of a screen display in which the files of FIG. 14 are restacked by category. As shown in FIG. 16, the stacks 793 and 794 correspond to the “XYZ Corp.” and “marketing reports” categories, respectively. The items 751 and 752, corresponding to documents 1 and 2, were not designated for any additional categories, and thus did not fall into any of the other category stacks.

FIG. 17 is a diagram illustrative of a screen display in which a quick link for physical folders is selected. The selection box SB is shown to be around the “all folders” quick link 616. As will be described in more detail below with respect to FIG. 18, the “all folders” quick link 616 provides for switching to a view of physical folders.

FIG. 18 is a diagram illustrative of a screen display showing physical folders. The physical folders that are shown contain the files of the virtual folder stacks of FIG. 17. In other words, the items contained within the stacks 651-655 of FIG. 17 are also contained in certain physical folders in the system. These are shown in FIG. 18 as a “My Documents” folder 851 that is located on the present computer, a “Desktop” folder 852 that is located on the present computer, a “Foo” folder 853 that is located on the hard drive C:, a “My Files” folder 854 that is located on a server, an “External Drive” folder 855 that is located on an external drive, a “My Documents” folder 856 that is located on another computer, and a “Desktop” folder 857 that is located on another computer.

As shown in FIG. 18, a user is able to switch from the virtual files representation of FIG. 17 to the physical file representation of FIG. 18. This allows a user to toggle between virtual file representations and physical file representations, depending on which is desired for a current task. The different locations of the physical folders 851-857 also illustrate that the scope of the virtual file system may be relatively broad, as will be described in more detail below.

FIG. 19 is a flow diagram illustrative of a routine 880 by which a user can directly manipulate virtual folders. As will be described in more detail below, the mechanisms that are provided for manipulating the virtual folders are similar to those that are currently used for manipulating regular folders (e.g., clicking and dragging, copying, pasting, etc.). As shown in FIG. 19, at a block 882, the system provides defined actions that the user can perform for direct manipulation of the virtual folders that are represented as display objects. At a block 884, the user performs a defined action. As noted above, one example of this might be a user clicking and dragging a virtual folder to copy its contents to another virtual folder. At a block 886, the virtual folder and/or contents are manipulated as directed by the action performed by the user.

FIG. 20 is a diagram illustrative of a screen display in which a new West Coast stack 656 has been added to the stacks of FIG. 10. The West Coast stack 656 was formed by a user creating a new category of “West Coast.” Upon its initial creation, the new West Coast stack 656 would be empty and have zero items. In the embodiment of FIG. 20, two items have been added to the West Coast stack 656. One method for adding items to a stack is to select a particular item, and either modify or add additional categories to the category metadata for the item, such as adding the category “West Coast” to two items as was done in the embodiment of FIG. 20. This process illustrates that the category data is a metadata property for an item that is a type of ad-hoc property. In other words, a property of this type does not have any implicit meaning, and can be assigned an arbitrary value by the user. For example, the category “property” can have any value whereas the “author” property should be the name of a person. As will be described in more detail below with reference to FIG. 21, items may also be clicked and dragged to be copied from other stacks to the West Coast stack 656 (in which case the categories of the items are automatically updated to include “West Coast”). In this regard, FIG. 20 shows that the selection box SB is around the ABC Corp. stack 651, in preparation for its contents being copied.

FIG. 21 is a diagram illustrative of a screen display in which direct manipulation is used for copying the files from the ABC Corp. stack 651 to the West Coast stack 656. In other words, as shown in FIG. 20, the user selected the ABC Corp. stack 651, and then as shown in FIG. 21 the user has clicked and dragged the stack to be copied to the West Coast stack 656. Thus, the West Coast stack 656 which had two items in FIG. 20, is now shown to include a total of ten items, including the additional eight items from the ABC Corp. stack 651. When the items from the ABC Corp. stack 651 were copied to the West Coast stack 656, this was accomplished by modifying the category descriptions of the eight items to also include the “West Coast” category in addition to including the original “ABC Corp.” category. This illustrates one type of direct manipulation that may be performed.

Another example of direct manipulation is right clicking an item and selecting delete. In one embodiment, when a deleting function is selected by a user, the user is queried whether the item should be deleted all together, or simply removed from the present virtual folder. If the item is just to be removed from a present virtual folder category stack as noted above, this can be accomplished by removing the desired category from the metadata for the item. In other words, if one of the items that had been copied from the ABC Corp. stack 651 to the West Coast stack 656 was then to be removed from the West Coast stack 656, this could be accomplished by modifying the category data for the particular file to no longer include the “West Coast” category.

FIG. 22 is a flow diagram illustrative of a routine 900 for the system dynamically generating new filter terms. Filter terms are utilized for manipulating the virtual folders. The filtering terms are essentially utilized as a set of tools for narrowing down a set of items. In one embodiment, filters consist of metadata categories and their values (presented to the user in the user interface as clickable links or drop-down menus). The user clicks on a filter term in order to filter down the current results set of items on the display.

FIG. 22 illustrates how filters may be dynamically generated. As shown in FIG. 22, at a block 902, the properties (from the metadata) of the items in a collection on the present display are reviewed. In a block 904, proposed filter terms are dynamically generated based on common properties of the items. At a block 906, the proposed filter terms are presented to the user for possible selection for filtering items. As an example of this process, the system may review the properties of a set of items, and if the items generally have “Authors” as a property, the filter can provide a list of the authors to filter by. Then, by clicking on a particular Author, the items that don't have that Author are removed from the set on the display. This filtering process provides the user with a mechanism for narrowing the set of items on the display.

FIG. 23 is a flow diagram illustrative of a routine 920 for the system filtering items based on the selection of a filter term. At a block 922, the user either enters a new filter term or else selects one of the filter terms that have been presented by the system. As noted above, the filter terms may be dynamically generated by the system, or they may be preset. At a block 924, the items from the collection on the display are evaluated with regard to whether their selected properties match the filter term. For example, if the filter term is for items that were authored by “Bob,” then the items are evaluated in accordance with whether their author property includes “Bob”. At block 926, the items for which the selected properties do not match the filter term are removed from the collection on the display.

FIG. 24 is a diagram illustrative of a screen display in which the stacks of FIG. 10 have been filtered by the term “AB”. As shown, in the filter area 621, the term “AB” has been typed by a user. The information lines 640 and 641 indicate that the items in the display are now those that have been filtered by the term “AB”. As shown, the ABC Corp. stack 651 still contains eight items, while the Backups stack 652 now contains three items, and the XYZ Corp. stack 654 also contains three items. The information line 644 thus indicates that there are a total of 14 items, taking up a total of 35 MB of memory.

FIG. 25 is a diagram illustrative of a screen display in which the stacks of FIG. 10 have been filtered by the term “ABC”. With regard to the filter term “AB” of FIG. 24, the user has simply typed the additional letter “C” to make the total filter term “ABC”. As shown in FIG. 25, the information lines 640 and 641 now indicate that the items on the display are those that contain the term “ABC”. The ABC Corp. stack 651 is still shown to contain eight items, while the Backups stack 652 now contains only two items. The information line 644 now indicates that there are a total of 10 items in the stacks on the display, which take up a total of 25 MB of memory. FIGS. 24 and 25 thus provide examples of how a user may enter new filter terms, and how those filter terms are then used to filter the items that are shown on the display.

FIG. 26 is a diagram illustrative of a screen display in which the system provided filter term “year 2002” is selected. As noted above, under the by date indicator 622, the year selections 623 include the years 2000, 2001, or 2002. The selection box SB is shown to be around the year 2002, indicating that the user is selecting that as the desired filter term.

FIG. 27 is a diagram illustrative of a screen display in which the filter term “2002” has been applied. Also shown is the further selection of the “pick a month” selector 623A. As shown in FIG. 27, after applying the filter term “2002”, the number of items in the stacks have been reduced. More specifically, the ABC Corp. stack 651 now contains six items, the Backups stack 652 now contains eight items, the Business Plans stack 653 now contains three items, and the XYZ Corp. stack 654 now contains five items. The information line 644 now indicates a total of 22 items, taking up a total of 50 MB of memory. The information lines 640 and 641 now indicate that the items shown on the display are those that have been filtered to contain the filter term “2002”.

FIG. 28 is a diagram illustrative of a screen display in which a list is presented for selecting a month for filtering. A box 950 is provided which includes the list of the months. The box 950 has been provided on the display due to the user selecting the “pick a month” selector 623A. The selection box SB is shown to be around the month of January.

FIG. 29 is a diagram illustrative of a screen display wherein the stacks of FIG. 28 have been further filtered by the month of January, and further showing a filter term of “day”. As shown in FIG. 29, the information lines 640 and 641 now indicate that the items on the display are those that have been filtered by the term “January”. The Backups stack 652 is now shown to contain two items, while the Business Plans stack 653 is also shown to contain two items. The information line 644 indicates that there are a total of four items on the display, which take up a total of 10 MB of memory. A “pick by day” selector 623B is provided, should the user wish to further filter the results to a specific day.

FIG. 30 is a flow diagram illustrative of a routine 940 for creating a new quick link. As will be described in more detail below, quick links are predefined links that can be clicked on by a user to create user selected views of the sets of items. In one embodiment, a quick link may be thought of as a type of pivot. Quick links provide a mechanism for retrieving a virtual folder. Clicking a quick link can take a user to a desired folder (in the same way that clicking a “favorites” may take a user to a Web site. The quick links can be predefined by the system, or can be set by a user. For example, clicking on “all authors” could return a view stacked by authors. Clicking on “all documents” may return a flat view for all of the documents for all of the storage areas. Users can also create their own quick links.

As shown in FIG. 30, at a block 942, a user makes a selection on the display to indicate that a new quick link should be formed from the present filter term or navigation. At a block 944, the user provides a new name for the new quick link. At a block 946, the new quick link is saved and the new quick link name is provided in the quick link section on the display.

FIG. 31 is a diagram illustrative of a screen display for creating a new quick link called “January Work” based on the filtering of FIG. 29. As described above, in FIG. 29, the stacks have been filtered by the month of January. In FIG. 31, the user has indicated that the filtering of FIG. 29 should be saved as a new quick link, and has named the new quick link “January work”. Thus, the new January work quick link 612 is shown in the quick links section of the display. With regard to forming new quick links, the user is generally provided with an option such as “save this collection as a quick link”.

FIG. 32 is a diagram illustrative of a screen display in which a quick link of “All Authors” is selected. As shown in FIG. 32, the selection box SB is shown around the All Authors selection 611. Other examples of collections that might be accessible by quick links include “all authors”, “recent documents”, “all documents I've shared”, “all documents I've authored”, “all documents not authored by me”, “desktop”, and “all types”.

FIG. 33 is a diagram illustrative of a screen display in which a list of all of the authors of the items of FIG. 32 is presented. As shown in FIG. 33, an information line 950 is provided, which indicates columns for showing the name of an item, the author, the modified date, the type, the size, and the location of an item. A list of Authors 951-954 are shown, corresponding to Authors 1-4, respectively.

FIG. 34 is a diagram illustrative of a screen display in which “Author 1” has been selected from the list of FIG. 33. The Author 1's documents include documents 951A and 951B, corresponding to documents 1 and 2, respectively. The document 951A is shown to have been authored by Author 1, was modified on 11 Jul., 2001, is a Microsoft Excel file, takes up 282 Kb of memory, and was obtained from the location \\server1\folder2. The document 951B is shown to have been authored by Author 1, was modified on 22 Dec., 2002, is a Microsoft Word file, takes up 206 kilobytes of memory, and is physically stored in the location My Documents\folder1. The locations of the documents 951A and 951B also illustrate that the virtual folders of the present invention may contain items from different physical locations, as will be described in more detail below.

FIG. 35 is a flow diagram illustrative of a routine 960 for creating a new library. One example of a library is the documents library described above with reference to FIG. 10. In general, libraries consist of large groups of usable types of files that can be associated together. For example, photos may be one library, music may be another, and documents may be another. Libraries may provide tools and activities that are related to the particular types of items. For example, in the photo library, there may be tools and filters that relate to manipulating photos, such as for creating slide shows or sharing pictures. As shown in FIG. 35, at a block 962, a new library is created which is to include items with selected characteristics. At a block 964, the selected items are grouped into the library. At a block 966, the tools and/or activities related to the selected characteristics of the items or to other desired functions are provided.

FIG. 36 is a diagram illustrative of a screen display in which a collection of available libraries are shown. As shown in FIG. 36, the libraries include a documents library 971, a photos and video library 972, a music library 973, a messages library 974, a contacts library 975, and a TV and movies library 976, as well as an all items library 977. The all items library 977 is shown to include 275 items, which is the total number of items from all of the other libraries combined. The information line 644 indicates a total of 275 items, which take up a total of 700 MB of memory. It should be noted that the documents library 971 is the library that was described above with respect to FIG. 10.

FIG. 37 is a flow diagram illustrative of a routine 990 for defining the scope of a virtual folder collection. As will be described in more detail below, a virtual folder system is able to represent items from multiple physical locations (e.g., different hard drives, different computers, different networks locations, etc.) so that to a user, all of the items are readily accessible. For example, a user can be presented with music files from multiple physical locations on a single display, and manipulate the files all at once.

As shown in FIG. 37, at a block 992, a scope is defined for the physical locations from which items are to be drawn. At a block 994, in response to a query, the items are drawn from the physical locations as defined in the scope. At a block 996, all of the items drawn by the query are presented on a single display.

FIG. 38 is a block diagram illustrative of the various sources which may form the scope of a virtual folder collection. As shown in FIG. 38, the system 1000 may include a present computer 1010, an additional computer 1020, external and removable storage 1030, and locations on a network 1040. The overall scope 1001 is described as including all of the physical locations from which a user's items are drawn to create collections. The scope may be set and modified by a user. As noted above, other figures have illustrated that items may come from different physical locations, such as FIG. 34 showing different documents coming from a server and a My Documents folder on a present computer, and in FIG. 18 showing physical folders that are physically stored in multiple locations.

FIG. 39 is a flow diagram illustrative of a routine 1080 for including non-file items in a virtual folder collection. Non-file items are contrasted with file items that are typically located in a physical file storage. Examples of non-file items would be things like e-mails, or contacts. As shown in FIG. 39, at a block 1082 a database is utilized to include non-file items along with file items that may be searched by a query. At a block 1084, in response to a query, both non-file items and file items are drawn to match the query. At a block 1086, both the non-file items and the file items that matched the query are presented on the display.

FIG. 40 is a diagram illustrative of a screen display showing various non-file items. As shown in FIG. 40, the items have been filtered to those that include “John”. The items are shown to include a contact item 1101, an e-mail item 1102, and document items 1103 and 1104. The contact item 1101 and e-mail item 1102 are non-file items. The present system allows such non-file items to be included with regular file items, such that they can be organized and manipulated as desired by a user. As was described above with respect to FIG. 2, such non-file items may be contained entirely within the relational database 230, which otherwise includes information about the properties of files.

As will be discussed in more detail below, the present invention provides the ability to share out virtual folders which may be static or dynamic. The sharing of static and dynamic lists allows a user to share selected items. A sharee is granted permission to the items in the list, and as the list is changed, the permissions are updated so that the sharee continues to have access to the current items of the list.

FIG. 41 is a block diagram illustrative of a memory system 4100 including a static list and a set of referenced items. The memory system 4100 includes a memory location 4110 which holds a static list, a memory location 4120 which holds an Item A, and a memory location 4130 which holds an Item B. The static list at the memory location 4110 includes a reference to the Item A, as well as an annotation for the Item A, and a reference to the Item B, as well as an annotation for the Item B. These annotations are not part of the actual items, but belong to the list. Some examples of types of static lists are a shopping list, a music play list, and a slide show of pictures.

FIG. 42 is a flow diagram illustrative of a routine 4200 for sharing a static list.

At a block 4210, the sharer indicates that the static list should be shared. At a decision block 4220, a determination is made as to whether the sharer has permission to share each item. If some of the items cannot be shared, then the routine continues to a block 4230, where the sharer is notified at the sharing time that the sharee may not be able to access the noted items. If each of the items can be shared, then the routine continues to a decision block 4250.

In the process of determining whether the sharer has permission to share each item, in one embodiment the list itself is the first item that the permission is determined for. In other words, the first step is to determine whether the sharer has permission to share the list itself. If the sharer does not have permission to share the list, then the sharer is notified that they do not have permission to share the list and the routine ends. If the sharer does have permission to share the list, then a determination is made for each of the items that are referenced by the list as to whether the sharer has permission to share each of the items. If the sharer does not have permission to share a particular item, then the sharer is notified that that item can not be shared. At the end of the process, for the set of items that the sharer does have permission to share, the routine continues to block 4250.

At decision block 4250, a determination is made as to whether the sharer has indicated that the sharee should be provided with read and write access as opposed to just read access. If the sharer indicated that read and write access should not be provided, then the routine continues to a block 4260 where the sharee is provided with read permission only. If the sharer indicated that the sharee should have read and write access, then the routine continues to a block 4270, where the sharee is provided with read and write permission. At block 4280, the designated access is granted to the sharee to the static list itself, as well as any items that are referenced in the static list. The sharee is then able to remotely access the static list and its referenced items from the sharer's computer.

FIG. 43 is a flow diagram illustrative of a routine 4300 for re-permissioning items that are added/removed from a static list. At a block 4310, the sharer adds or removes items from the static list. At a block 4320, the items are re-permissioned to grant or remove access for sharees of the static list. As an example, if the sharer removed a picture from the list, then the sharee would also lose permission to this picture. Alternatively, if the sharer added a song to a play list, the sharee would be granted access to this song. In an alternate embodiment, the items may also be dynamically permissioned as they come and go from the static list, since the actual definition of the static list lives in the database and can be monitored as it changes.

FIG. 44 is a flow diagram illustrative of a routine 4400 for creating a dynamic list. At a block 4410, a user provides a scope and a set of criteria for creating the dynamic list. At a block 4420, the processor passes the scope and set of criteria to a relational database. At a block 4430, the relational database provides results back to the processor. At a block 4440, the processor provides results back as items in the dynamic list.

As described in more detail above with respect to FIG. 10, certain virtual folders such as libraries rely on dynamic lists for their creation. For example, a user would typically go to their document library to find their documents. The document library is a type of dynamic list. The scope for the list may be set to be the data storage that is available on a local machine, or as another example may include data stored on all of the machines on a network.

FIG. 45 is a block diagram illustrative of a memory system 4500 including a dynamic list and a set of referenced items. The memory system 4500 includes a memory location 4510 which holds a dynamic list, a memory location 4520 which holds an Item A, a memory location 4530 which holds an Item B, and a memory location 4540 which holds an Item C. The dynamic list that is stored at the memory location 4510 has a scope to include all of the memory system 4500 and has criteria including case=X and client=100. The referenced items which meet the criteria include a reference to the Item A and a reference to the Item B. The Item A that is stored at the memory location 4520 has properties of case=X and client=100 and the Item B that is stored at the memory location 4530 has properties of case=X and client=100. The Item C that is stored at the memory location 4540 has properties of case=X and client=99. Since the property of the client=99 of the Item C does not match the criteria of the dynamic list that is stored at the memory location 4510, the Item C is not referenced in the list.

FIG. 46 is a flow diagram illustrative of a routine 4600 for sharing a dynamic list. At a block 4610, a sharer indicates that the dynamic list is to be shared. At a decision block 4620, a determination is made as to whether the sharer has permission to share each of the items on the list. If some of the items cannot be shared, then the routine continues to a block 4630 where the sharer is notified at the sharing time that the sharee may not be able to access the noted items. If each of the items can be shared, then the routine continues to a decision block 4640.

At decision block 4640, a determination is made as to whether the sharer wants to share the items only in the static list format. In other words, a determination is made as to whether the sharer wants to share the current items in the form of a static list rather than a dynamic list. If a static list is to be shared, then the routine continues to a block 4650 where a static list that represents what is currently in the dynamic list is generated and that static list is shared as described above with respect to FIG. 42. If the sharer does not want to only share in static list form, then the routine continues to a block 4660.

At block 4660, all of the items that meet the criteria of the dynamic list are shared. This means that the items are left at their respective storage places on the machine where the sharing is occurring and the items are permissioned to allow the sharee to have access to the items. At the conclusion of this process, the sharee is able to remotely access the list and its referenced items from the sharer's computer.

FIG. 47 is a flow diagram illustrative of a routine 4700 for re-permissioning items that are removed or added from a dynamic list. At a block 4710, an item has a property change such that it meets or no longer meets the dynamic list criteria. At a block 4720, the item is re-permissioned to appropriately grant or remove access for sharees of the dynamic list. In other words, if an item that is currently on the dynamic list has its property change such that it no longer meets the criteria of the dynamic list, then this item is re-permissioned to remove access for sharees of the dynamic list. In the same way, if any items that previously were not on the dynamic list have a property change such that they now fall into the scope and meet the criteria of the dynamic list, they are re-permissioned to grant access to the sharees of the dynamic list.

FIG. 48 is a block diagram illustrative of a memory system 4800 including a dynamic list from which an item has been removed. The memory system 4800 includes a memory location 4810 which holds a dynamic list, a memory location 4820 which holds an Item A, a memory location 4830 which holds an Item B, and a memory location 4840 which holds an Item C. The memory system 4800 is similar to the memory system 4500 of FIG. 45. In the example of FIG. 48, the Item B at the storage location 4830 has had its client property changed such that the client=99. Because of this change, the Item B no longer meets the criteria of the dynamic list which requires that the client=100. Thus, the Item B has been removed from the dynamic list that is stored at the memory location 4810. Sharees of the dynamic list will thus no longer have permission to the Item B.

FIG. 49 is a block diagram illustrative of a memory system 4900 including a dynamic list to which items have been added. The memory system 4900 includes a memory location 4910 which holds a dynamic list, a memory location 4920 which holds an Item A, a memory location 4930 which holds an Item B, a memory location 4940 which holds an Item C, and a memory location 4950 which holds a new Item D. Relative to the dynamic list at the memory location 4810 of FIG. 48, the dynamic list at the memory location 4910 of FIG. 49 is shown to have added references to Items C and D. This has occurred because the Item C at memory location 4940 and the new Item D at the memory location 4950 have had their client properties changed or set to be client=100. This change has caused the Items C and D to now meet the criteria of the dynamic list stored at memory location 4910, and the dynamic list thus now includes references to these items. This results in sharees of the dynamic list now being permissioned with access to the Items C and D.

FIG. 50 is a flow diagram of a routine 5000 for calling a sharing API. At a block 5010, a sharing API is called regarding the sharing of a list. At a block 5020, in response to the call permissions are provided to the list and the referenced items. As described above, both static and dynamic lists may be shared.

A programming interface may be utilized as part of the list sharing process. As will be described in more detail below with respect to FIGS. 51A-51L, a programming interface (or more simply, interface) such as that used in the list sharing process may be viewed as any mechanism, process, protocol for enabling one or more segment(s) of code to communicate with or access the functionality provided by one or more other segment(s) of code. Alternatively, a programming interface may be viewed as one or more mechanism(s), method(s), function call(s), module(s), object(s), etc., of a component of a system capable of communicative coupling to one or more mechanism(s), method(s), function call(s), module(s), etc. of other component(s). The term “segment of code” in the preceding sentence is intended to include one or more instructions or lines of code, and includes, e.g., code modules, objects, subroutines, functions, and so on, regardless of the terminology applied or whether the code segments are separately compiled, or whether the code segments are provided as source, intermediate, or object code, whether the code segments are utilized in a runtime system or process, or whether they are located on the same or different machines or distributed across multiple machines, or whether the functionality represented by the segments of code are implemented wholly in software, wholly in hardware, or a combination of hardware and software.

Notionally, a programming interface may be viewed generically, as shown in FIG. 51A or FIG. 51B. FIG. 51A illustrates an interface Interface 1 as a conduit through which first and second code segments communicate. FIG. 51B illustrates an interface as comprising interface objects I1 and I2 (which may or may not be part of the first and second code segments), which enable first and second code segments of a system to communicate via medium M. In the view of FIG. 51B, one may consider interface objects I1 and I2 as separate interfaces of the same system and one may also consider that objects I1 and I2 plus medium M comprise the interface. Although FIGS. 51A and 51B show bi-directional flow and interfaces on each side of the flow, certain implementations may only have information flow in one direction (or no information flow as described below) or may only have an interface object on one side. By way of example, and not limitation, terms such as application programming interface (API), entry point, method, function, subroutine, remote procedure call, and component object model (COM) interface, are encompassed within the definition of programming interface.

Aspects of such a programming interface may include the method whereby the first code segment transmits information (where “information” is used in its broadest sense and includes data, commands, requests, etc.) to the second code segment; the method whereby the second code segment receives the information; and the structure, sequence, syntax, organization, schema, timing and content of the information. In this regard, the underlying transport medium itself may be unimportant to the operation of the interface, whether the medium be wired or wireless, or a combination of both, as long as the information is transported in the manner defined by the interface. In certain situations, information may not be passed in one or both directions in the conventional sense, as the information transfer may be either via another mechanism (e.g., information placed in a buffer, file, etc., separate from information flow between the code segments) or non-existent, as when one code segment simply accesses functionality performed by a second code segment. Any or all of these aspects may be important in a given situation, e.g., depending on whether the code segments are part of a system in a loosely coupled or tightly coupled configuration, and so this list should be considered illustrative and non-limiting.

This notion of a programming interface is known to those skilled in the art and is clear from the foregoing detailed description of the invention. There are, however, other ways to implement a programming interface, and, unless expressly excluded, these too are intended to be encompassed by the claims set forth at the end of this specification. Such other ways may appear to be more sophisticated or complex than the simplistic view of FIGS. 51A and 51B, but they nonetheless perform a similar function to accomplish the same overall result. We will now briefly describe some illustrative alternative implementations of a programming interface.

FIGS. 51C and 51D illustrate a factoring implementation. In accordance with a factoring implementation, a communication from one code segment to another may be accomplished indirectly by breaking the communication into multiple discrete communications. This is depicted schematically in FIGS. 51C and 51D. As shown, some interfaces can be described in terms of divisible sets of functionality. Thus, the interface functionality of FIGS. 51A and 51B may be factored to achieve the same result, just as one may mathematically provide 24, or 2 times 2 time 3 times 2. Accordingly, as illustrated in FIG. 51C, the function provided by interface Interface1 may be subdivided to convert the communications of the interface into multiple interfaces Interface 1A, Interface 1B, Interface 1C, etc., while achieving the same result. As illustrated in FIG. 51D, the function provided by interface I1 may be subdivided into multiple interfaces I1a, I1b, I1c, etc., while achieving the same result. Similarly, interface 12 of the second code segment which receives information from the first code segment may be factored into multiple interfaces I2a, I2b, I2c, etc. When factoring, the number of interfaces included with the 1^stcode segment need not match the number of interfaces included with the 2^ndcode segment. In either of the cases of FIGS. 51C and 51D, the functional spirit of interfaces Interface1 and I1 remain the same as with FIGS. 51A and 51B, respectively. The factoring of interfaces may also follow associative, commutative, and other mathematical properties such that the factoring may be difficult to recognize. For instance, ordering of operations may be unimportant, and consequently, a function carried out by an interface may be carried out well in advance of reaching the interface, by another piece of code or interface, or performed by a separate component of the system. Moreover, one of ordinary skill in the programming arts can appreciate that there are a variety of ways of making different function calls that achieve the same result.

FIGS. 51E and 51F illustrate a redefinition implementation. In accordance with a redefinition implementation, in some cases, it may be possible to ignore, add or redefine certain aspects (e.g., parameters) of a programming interface while still accomplishing the intended result. This is illustrated in FIGS. 51E and 51F. For example, assume interface Interface1 of FIG. 51A includes a function call Square(input, precision, output), a call that includes three parameters, input, precision and output, and which is issued from the 1^stCode Segment to the 2^ndCode Segment., If the middle parameter precision is of no concern in a given scenario, as shown in FIG. 51E, it could just as well be ignored or even replaced with a meaningless (in this situation) parameter. One may also add an additional parameter of no concern. In either event, the functionality of square can be achieved, so long as output is returned after input is squared by the second code segment. Precision may very well be a meaningful parameter to some downstream or other portion of the computing system; however, once it is recognized that precision is not necessary for the narrow purpose of calculating the square, it may be replaced or ignored. For example, instead of passing a valid precision value, a meaningless value such as a birth date could be passed without adversely affecting the result. Similarly, as shown in FIG. 51F, interface I1 is replaced by interface I1′, redefined to ignore or add parameters to the interface. Interface I2 may similarly be redefined as interface I2′, redefined to ignore unnecessary parameters, or parameters that may be processed elsewhere. The point here is that in some cases a programming interface may include aspects, such as parameters, that are not needed for some purpose, and so they may be ignored or redefined, or processed elsewhere for other purposes.

FIGS. 51G and 51H illustrate an inline coding implementation. In accordance with an inline coding implementation, it may also be feasible to merge some or all of the functionality of two separate code modules such that the “interface” between them changes form. For example, the functionality of FIGS. 51A and 51B may be converted to the functionality of FIGS. 51G and 51H, respectively. In FIG. 51G, the previous 1^stand 2^ndCode Segments of FIG. 51A are merged into a module containing both of them. In this case, the code segments may still be communicating with each other but the interface may be adapted to a form which is more suitable to the single module. Thus, for example, formal Call and Return statements may no longer be necessary, but similar processing or response(s) pursuant to interface Interface1 may still be in effect. Similarly, shown in FIG. 51H, part (or all) of interface I2 from FIG. 51B may be written inline into interface I1 to form interface I1″. As illustrated, interface 12 is divided into 12a and 12b, and interface portion 12a has been coded in-line with interface I1 to form interface I1″. For a concrete example, consider that the interface I1 from FIG. 51B performs a function call square (input, output), which is received by interface I2, which after processing the value passed with input (to square it) by the second code segment, passes back the squared result with output. In such a case, the processing performed by the second code segment (squaring input) can be performed by the first code segment without a call to the interface.

FIGS. 51I and 51J illustrate a divorce implementation. In accordance with a divorce implementation, a communication from one code segment to another may be accomplished indirectly by breaking the communication into multiple discrete communications. This is depicted schematically in FIGS. 51I and 51J. As shown in FIG. 51I, one or more piece(s) of middleware (Divorce Interface(s), since they divorce functionality and/or interface functions from the original interface) are provided to convert the communications on the first interface, Interface1, to conform them to a different interface, in this case interfaces Interface2A, Interface2B and Interface2C. This might be done, e.g., where there is an installed base of applications designed to communicate with, say, an operating system in accordance with an Interface1 protocol, but then the operating system is changed to use a different interface, in this case interfaces Interface2A, Interface2B and Interface2C. The point is that the original interface used by the 2^ndCode Segment is changed such that it is no longer compatible with the interface used by the 1^stCode Segment, and so an intermediary is used to make the old and new interfaces compatible. Similarly, as shown in FIG. 51J, a third code segment can be introduced with divorce interface DI1 to receive the communications from interface I1 and with divorce interface DI2 to transmit the interface functionality to, for example, interfaces I2a and I2b, redesigned to work with DI2, but to provide the same functional result. Similarly, DI1 and DI2 may work together to translate the functionality of interfaces I1 and I2 of FIG. 51B to a new operating system, while providing the same or similar functional result.

FIGS. 51K and 51L illustrate a rewriting implementation. In accordance with a rewriting implementation, yet another possible variant is to dynamically rewrite the code to replace the interface functionality with something else but which achieves the same overall result. For example, there may be a system in which a code segment presented in an intermediate language (e.g., Microsoft IL, Java ByteCode, etc.) is provided to a Just-in-Time (JIT) compiler or interpreter in an execution environment (such as that provided by the Net framework, the Java runtime environment, or other similar runtime type environments). The JIT compiler may be written so as to dynamically convert the communications from the 1st Code Segment to the 2^ndCode Segment, i.e., to conform them to a different interface as may be required by the 2^ndCode Segment (either the original or a different 2^ndCode Segment). This is depicted in FIGS. 51K and 51L. As can be seen in FIG. 51K, this approach is similar to the divorce configuration described above. It might be done, e.g., where an installed base of applications are designed to communicate with an operating system in accordance with an Interface 1 protocol, but then the operating system is changed to use a different interface. The JIT Compiler could be used to conform the communications on the fly from the installed-base applications to the new interface of the operating system. As depicted in FIG. 51L, this approach of dynamically rewriting the interface(s) may be applied to dynamically factor, or otherwise alter the interface(s) as well.

It is also noted that the above-described scenarios for achieving the same or similar result as an interface via alternative embodiments may also be combined in various ways, serially and/or in parallel, or with other intervening code. Thus, the alternative embodiments presented above are not mutually exclusive and may be mixed, matched and combined to produce the same or equivalent scenarios to the generic scenarios presented in FIGS. 51A and 51B. It is also noted that, as with most programming constructs, there are other similar ways of achieving the same or similar functionality of an interface which may not be described herein, but nonetheless are represented by the spirit and scope of the invention, i.e., it is noted that it is at least partly the functionality represented by, and the advantageous results enabled by, an interface that underlie the value of an interface.

While the preferred embodiment of the invention has been illustrated and described, it will be appreciated that various changes can be made therein without departing from the spirit and scope of the invention.

Claims

1. A method of designating items as available to share in a computer system between a sharer that makes items available and a sharee that views the items that were made available comprising: executing on the sharer's computer a query comprising a scope and a criteria, wherein the scope and the criteria are submitted by the user of the sharer's computer, and wherein the scope defines at least a portion of a physical storage location;creating on the sharer's computer a dynamic list with a plurality of referenced items based on results of said query, wherein the referenced items include electronic files and electronic folders; wherein when an item that is on the dynamic list has a property change that is no longer meets the criteria of the query, the item is removed from the dynamic list, and wherein when the item that was not previously on the dynamic list has a property change that meets the criteria of the query, the item is added to the dynamic list;defining the contents of one or more virtual folders on the sharer's computer based on the dynamic list, the one or more virtual folders configured to manipulate by an action of at least the sharer, said manipulation is at least one of dragging, copying and pasting,making the contents of the one or more virtual folders available for sharing with the sharee, thereby making the results of said query available to the sharee: andsharing at least a portion of the one or more virtual folders with the sharee, wherein the sharee is provided with access to the referenced items from the share's computer.
2. The method of claim 1, wherein when the sharer is unable to grant access to the sharee for an item, a notification is provided to the sharer.
3. The method of claim 1, wherein the sharer is able to limit the type of access that the sharee has to the items.
4. The method of claim 1, wherein the creating step comprises defining within the list an order of the plurality of referenced items.
5. The method of claim 1, wherein the creating step comprises defining within the list an annotation corresponding to at least one of the plurality of referenced items.
6. The method of claim 1, wherein the sharee is provided with remote access to the referenced items from another computer.
7. A method for sharing items on a computer system comprising: receiving permission to access a list on the sharer's computer with referenced items, wherein the referenced items are based on the results of a query that includes a scope and a criteria provided by the sharer executed on the sharer's computer, and the list defines the contents of one or more virtual folders on the sharer's computer, and wherein the scope defines at least a portion of a physical storage location, and wherein referenced items include electronic files and electronic folders;in response to receiving the permission to access the list, accessing the list and the referenced items that have been determined by the sharer's computer to be shared in a sharing format, the sharing format being a dynamic list;wherein when an item that is on the dynamic list has a property change that is no longer meets the criteria of the query, the item is removed from the dynamic list, and wherein when an item that was not previously on the dynamic list has a property change that meets the criteria of the query, the item is added to the dynamic list; andwherein the one or more virtual folders are configured to manipulate by an action of at least the sharer, said manipulation is at least one of dragging, copying, and pasting.
8. The method of claim 7, wherein when access to an item is unavailable, a notification is provided.
9. The method of claim 7, wherein the permission to access the list specifies the type of access that is available for the items.
10. The method of claim 7, wherein the list comprises a predefined order of the referenced items.
11. The method of claim 7, wherein the list comprises an annotation corresponding to at least one of the referenced items.
12. The method of claim 7, wherein accessing the list and the referenced items is performed remotely from another computer.
13. One or more computer-readable storage media for enabling a computer-program segment to communicate with one or more other computer-program segments, said media comprising: a set of computer-usable instructions that cause a request to provide access to a set of items to be communicated to one or more other computer-program segments capable of executing said request, wherein the set of items include results of a query having a scope and criteria provided by the sharer executed on the sharer's computer, and wherein the results are included one or more virtual folders on the sharer's computer, wherein the scope defines at least a portion of a physical storage location, and wherein the set of items include electronic files and electronic folders; andwherein the one or more virtual folders are configured to manipulate by an action of at least the sharer, said manipulation is at least one of dragging, copying, and pasting, said referenced items are determined by the sharer's computer to share in a sharing format, the sharing format being a dynamic list format, wherein when an item that is on the dynamic list has a property change that is no longer meets the criteria of the query, the item is removed from the dynamic list, and wherein when an item that was not previously on the dynamic list has a property change that meets the criteria of the query, the item is added to the dynamic list.
14. The media of claim 13, wherein when access to an item is unavailable, a notification is provided.
15. The media of claim 13, wherein the access to the items may be limited to be one of read/write or read only.
16. The computer readable medium of claim 13, wherein the request to provide access comprises a request to provide remote access from another computer.
17. A method of communicating between a sharer of a dynamic list and a sharee comprising: Receiving from the sharee, a call for accessing, on a computer of the sharer, items that are referenced on the dynamic list, wherein the list is based on results of a query with a scope and a criteria provided by the sharer executed on the sharer's computer referenced in one or more virtual folders on the sharer's computer, and stored on the sharer's computer, and determined by the sharer's computer to share in a sharing format, wherein the sharing format is the dynamic list format, wherein the scope defines at least a portion of a physical storage location, and wherein the sharer items include electronic files and electronic folders;responsive to authorization received from the sharer, providing the sharee access to the items in the determined sharing format; wherein when an item that is on the dynamic list has a property change that is no longer meets the criteria of the query. the item is removed from the dynamic list, and wherein when an item that was not previously on the dynamic list has a property change that meets the criteria of the query, the item is added to the dynamic list; andwherein the one or more virtual folders are configured to manipulate by an action of at least the sharer, said manipulation is at least one of dragging, copying, and pasting.
18. The method of claim 17, wherein when access may be unavailable to an item, that is on the list when the list is shared, a notification is provided to the sharer.
19. The method of claim 17, wherein the sharer is able to limit the type of access to the items.
20. The method of claim 17, wherein the list comprise a predefined order of the referenced items.
21. The method of claim 17, wherein the list comprises an annotation corresponding to at least one of the referenced items.
22. The method of claim 17, wherein providing the sharee access to the items comprises providing the sharee remote access to the items.
23. The method of claim 17, wherein the receiving step comprises receiving the call via an API.
24. One or more computer-readable storage media for enabling a sharer to share a set of items that are referenced on a dynamic list with a sharee comprising: a set of computer-usable instructions that allow the sharee to access the items directly through the sharer's computer, wherein the items include electronic files and electronic folders,wherein the set of items referenced on the list are based on results of a query with a scope and a criteria provided by the sharer executed on the sharer's computer, wherein the scope defines at least a portion of a physical storage location, and wherein the dynamic list comprises an order of the items referenced on the dynamic list, the dynamic list is referenced in one or more virtual folders on the sharer's computer, the list is determined by the sharer's computer to be shared to the sharee in a sharing format, the sharing format being the dynamic list format, wherein when an item that is on the dynamic list has a property change such as that is no longer meets the criteria of the query, the item is removed from the dynamic list, and wherein when an item that was not previously on the dynamic list has a property change such that it meets the criteria of the query, the item is added to the dynamic list; and the one or more virtual folders are configured to by be manipulated by an action of at least the sharer, said manipulation is at least one of dragging, copying, and pasting.
25. The media of claim 24, wherein the type of access that is provided to the items may be one of read or read-write
26. The one or more computer readable media of claim 24, wherein the set of computer-usable instructions allow the sharee to remotely access the items.
27. A method for sharing items in a computer system between a sharer and a sharee comprising: executing on the sharer's computer a query comprising a scope and a criteria provided by the sharer, wherein the scope defines at least a portion of a physical storage location;creating on the sharer's computer one or more virtual folders with a plurality of referenced items based on results of said query, wherein the referenced items include electronic files and electronic folders;determining a sharing format of the list to share to the sharee, wherein the sharing format is a dynamic list; wherein when an item that is on the dynamic list has a property change that is no longer meets the criteria of the query, the item is removed from the dynamic list, and wherein when an item that was not previously on the dynamic list has a property change that meets the criteria of the query, the item is added to the dynamic list;sharing the one or more virtual folders with a sharee such that the sharee is provided with access to the referenced items from the sharer's computer in the determined sharing format; andwherein the one or more virtual folders are configured to manipulate by an action of at least the sharer, said manipulation is at least one of dragging, copying, and pasting.
28. The method of claim 27, wherein when the sharer removes items from the virtual folder, the sharee is no longer provided with access to the items.
29. The method of claim 27, wherein when itesm are added to the virtual folder, the sharee is provided with access to the added items.
30. The method of claim 27, wherein tin the sharing setup the sharee is provided with remote access to the referenced items.

CROSS-REFERENCE(S) TO RELATED APPLICATION(S)

This application is a continuation-in-part of U.S. patent application Ser. No. 10/403,174, filed Mar. 27, 2003, priority from the filing date of which is hereby claimed under 35 U.S.C. § 120.

US Referenced Citations (311)

Number	Name	Date	Kind
5241671	Reed et al.	Aug 1993	A
5333315	Saether et al.	Jul 1994	A
5388196	Pajak et al.	Feb 1995	A
5461710	Bloomfield et al.	Oct 1995	A
5499364	Klein et al.	Mar 1996	A
5504852	Thompson-Rohrlich	Apr 1996	A
5513306	Mills et al.	Apr 1996	A
5559948	Bloomfield et al.	Sep 1996	A
5598524	Johnston, Jr. et al.	Jan 1997	A
5630042	McIntosh et al.	May 1997	A
5680563	Edelman	Oct 1997	A
5696486	Poliquin et al.	Dec 1997	A
5757925	Faybishenko	May 1998	A
5790121	Sklar et al.	Aug 1998	A
5802516	Shwarts et al.	Sep 1998	A
5831606	Nakajima et al.	Nov 1998	A
5835094	Ermel et al.	Nov 1998	A
5838317	Bolnick et al.	Nov 1998	A
5838322	Nakajima et al.	Nov 1998	A
5867163	Kurtenbach	Feb 1999	A
5875446	Brown et al.	Feb 1999	A
5878410	Zbikowski et al.	Mar 1999	A
5899995	Millier et al.	May 1999	A
5907837	Ferrel et al.	May 1999	A
5923328	Griesmer	Jul 1999	A
5929854	Ross	Jul 1999	A
5933139	Feigner et al.	Aug 1999	A
5935210	Stark	Aug 1999	A
5987454	Hobbs	Nov 1999	A
5987506	Carter et al.	Nov 1999	A
6003040	Mital et al.	Dec 1999	A
6008806	Nakajima et al.	Dec 1999	A
6014137	Burns	Jan 2000	A
6021262	Cote et al.	Feb 2000	A
6023708	Mendez et al.	Feb 2000	A
6025843	Sklar	Feb 2000	A
6037944	Hugh	Mar 2000	A
6061692	Thomas et al.	May 2000	A
6061695	Slivka et al.	May 2000	A
6078924	Ainsbury et al.	Jun 2000	A
6097389	Morris et al.	Aug 2000	A
6144968	Zellweger	Nov 2000	A
6147601	Sandelman et al.	Nov 2000	A
6181342	Niblack	Jan 2001	B1
6202061	Khosla et al.	Mar 2001	B1
6237011	Ferguson et al.	May 2001	B1
6240421	Stolarz	May 2001	B1
6243094	Sklar	Jun 2001	B1
6243724	Mander et al.	Jun 2001	B1
6246411	Strauss	Jun 2001	B1
6256031	Meijer et al.	Jul 2001	B1
6275829	Angiulo et al.	Aug 2001	B1
6308173	Glasser et al.	Oct 2001	B1
6317142	Decoste et al.	Nov 2001	B1
6324551	Lamping et al.	Nov 2001	B1
6339767	Rivette et al.	Jan 2002	B1
6341280	Glass et al.	Jan 2002	B1
6356863	Sayle	Mar 2002	B1
6363377	Kravets et al.	Mar 2002	B1
6363400	Chtchetkine et al.	Mar 2002	B1
6401097	McCotter et al.	Jun 2002	B1
6411311	Rich et al.	Jun 2002	B1
6430575	Dourish et al.	Aug 2002	B1
6437807	Berquist et al.	Aug 2002	B1
6438590	Gartner et al.	Aug 2002	B1
6448985	McNally	Sep 2002	B1
6453311	Powers, III	Sep 2002	B1
6453319	Mattis et al.	Sep 2002	B1
6466238	Berry et al.	Oct 2002	B1
6466932	Dennis et al.	Oct 2002	B1
6480835	Light	Nov 2002	B1
6505233	Hanson et al.	Jan 2003	B1
6513038	Hasegawa et al.	Jan 2003	B1
6526399	Coulson et al.	Feb 2003	B1
6535229	Kraft	Mar 2003	B1
6535230	Celik	Mar 2003	B1
6539399	Hazama et al.	Mar 2003	B1
6544295	Bodnar	Apr 2003	B1
6549217	De Greef et al.	Apr 2003	B1
6549916	Sedlar	Apr 2003	B1
6563514	Samar	May 2003	B1
6573906	Harding et al.	Jun 2003	B1
6573907	Madrane	Jun 2003	B1
6583799	Manolis et al.	Jun 2003	B1
6590585	Suzuki et al.	Jul 2003	B1
6606105	Quartetti	Aug 2003	B1
6613101	Mander et al.	Sep 2003	B2
6628309	Dodson et al.	Sep 2003	B1
6636238	Amir et al.	Oct 2003	B1
6636250	Gasser	Oct 2003	B1
6662198	Satyanarayanan et al.	Dec 2003	B2
6684222	Cornelius et al.	Jan 2004	B1
6735623	Prust	May 2004	B1
6738770	Gorman	May 2004	B2
6745206	Mandler et al.	Jun 2004	B2
6754829	Butt et al.	Jun 2004	B1
6762776	Huapaya	Jul 2004	B2
6762777	Carroll	Jul 2004	B2
6763458	Watanabe et al.	Jul 2004	B1
6768999	Prager et al.	Jul 2004	B2
6784900	Dobronsky et al.	Aug 2004	B1
6795094	Watanabe et al.	Sep 2004	B1
6801919	Hunt et al.	Oct 2004	B2
6803926	Lamb et al.	Oct 2004	B1
6813474	Robinson et al.	Nov 2004	B2
6816863	Bates et al.	Nov 2004	B2
6823344	Isensee et al.	Nov 2004	B1
6847959	Arrouye et al.	Jan 2005	B1
6853391	Bates et al.	Feb 2005	B2
6865568	Chau	Mar 2005	B2
6871348	Cooper	Mar 2005	B1
6876996	Czajkowski et al.	Apr 2005	B2
6880132	Uemura	Apr 2005	B2
6883009	Yoo	Apr 2005	B2
6883146	Prabhu et al.	Apr 2005	B2
6906722	Hrebejk et al.	Jun 2005	B2
6922709	Goodman	Jul 2005	B2
6938207	Haynes	Aug 2005	B1
6944647	Shah et al.	Sep 2005	B2
6947959	Gill	Sep 2005	B1
6950818	Dennis et al.	Sep 2005	B2
6952714	Peart	Oct 2005	B2
6952724	Prust	Oct 2005	B2
6980993	Horvitz et al.	Dec 2005	B2
7010755	Anderson et al.	Mar 2006	B2
7043472	Aridor et al.	May 2006	B2
7051291	Sciammarella et al.	May 2006	B2
7062500	Hall et al.	Jun 2006	B1
7068291	Roberts et al.	Jun 2006	B1
7139811	Lev Ran et al.	Nov 2006	B2
7149729	Kaasten et al.	Dec 2006	B2
7168051	Robinson et al.	Jan 2007	B2
7203948	Mukundan et al.	Apr 2007	B2
20010034771	Hutsch et al.	Oct 2001	A1
20010047368	Oshinsky et al.	Nov 2001	A1
20010049675	Mandler et al.	Dec 2001	A1
20010053996	Atkinson	Dec 2001	A1
20010056434	Kaplan et al.	Dec 2001	A1
20010056508	Arneson et al.	Dec 2001	A1
20020010736	Marques et al.	Jan 2002	A1
20020019935	Andrew et al.	Feb 2002	A1
20020033844	Levy et al.	Mar 2002	A1
20020046232	Adams et al.	Apr 2002	A1
20020046299	Lefeber et al.	Apr 2002	A1
20020049717	Routtenberg et al.	Apr 2002	A1
20020052885	Levy	May 2002	A1
20020054167	Hugh	May 2002	A1
20020059199	Harvey	May 2002	A1
20020062310	Marmor et al.	May 2002	A1
20020075310	Prabhu et al.	Jun 2002	A1
20020075312	Amadio et al.	Jun 2002	A1
20020075330	Rosenzweig et al.	Jun 2002	A1
20020087740	Castanho et al.	Jul 2002	A1
20020087969	Brunheroto et al.	Jul 2002	A1
20020089540	Geier et al.	Jul 2002	A1
20020091679	Wright	Jul 2002	A1
20020091697	Huang et al.	Jul 2002	A1
20020091739	Ferlitsch et al.	Jul 2002	A1
20020095416	Schwols	Jul 2002	A1
20020097278	Mandler et al.	Jul 2002	A1
20020103998	DeBruine	Aug 2002	A1
20020104069	Gouge et al.	Aug 2002	A1
20020107973	Lennon et al.	Aug 2002	A1
20020111942	Campbell et al.	Aug 2002	A1
20020113821	Hrebejk et al.	Aug 2002	A1
20020120505	Henkin et al.	Aug 2002	A1
20020120757	Sutherland et al.	Aug 2002	A1
20020129033	Hoxie et al.	Sep 2002	A1
20020138552	DeBruine et al.	Sep 2002	A1
20020138582	Chandra et al.	Sep 2002	A1
20020138744	Schleicher et al.	Sep 2002	A1
20020144155	Bate et al.	Oct 2002	A1
20020152262	Arkin et al.	Oct 2002	A1
20020152267	Lennon	Oct 2002	A1
20020156895	Brown	Oct 2002	A1
20020161800	Eld et al.	Oct 2002	A1
20020163572	Center et al.	Nov 2002	A1
20020169678	Chao et al.	Nov 2002	A1
20020184357	Traversat et al.	Dec 2002	A1
20020188605	Adya et al.	Dec 2002	A1
20020188735	Needham et al.	Dec 2002	A1
20020194252	Powers, III	Dec 2002	A1
20020196276	Corl et al.	Dec 2002	A1
20020199061	Friedman et al.	Dec 2002	A1
20030009484	Hamanaka et al.	Jan 2003	A1
20030014415	Weiss et al.	Jan 2003	A1
20030018657	Monday	Jan 2003	A1
20030018712	Harrow et al.	Jan 2003	A1
20030028610	Pearson	Feb 2003	A1
20030041178	Brouk et al.	Feb 2003	A1
20030046260	Satyanarayanan et al.	Mar 2003	A1
20030069893	Kanai et al.	Apr 2003	A1
20030069908	Anthony et al.	Apr 2003	A1
20030074356	Kaler et al.	Apr 2003	A1
20030078918	Souvignier et al.	Apr 2003	A1
20030093321	Bodmer et al.	May 2003	A1
20030093531	Yeung et al.	May 2003	A1
20030093580	Thomas et al.	May 2003	A1
20030097361	Huang et al.	May 2003	A1
20030101200	Koyama et al.	May 2003	A1
20030105745	Davidson et al.	Jun 2003	A1
20030110188	Howard et al.	Jun 2003	A1
20030115218	Bobbitt et al.	Jun 2003	A1
20030117403	Park et al.	Jun 2003	A1
20030117422	Hiyama et al.	Jun 2003	A1
20030120928	Cato et al.	Jun 2003	A1
20030120952	Tarbotton et al.	Jun 2003	A1
20030122873	Dieberger et al.	Jul 2003	A1
20030126136	Omoigui	Jul 2003	A1
20030126212	Morris et al.	Jul 2003	A1
20030135495	Vagnozzi	Jul 2003	A1
20030135517	Kauffman	Jul 2003	A1
20030135659	Bellotti et al.	Jul 2003	A1
20030140115	Mehra	Jul 2003	A1
20030154185	Suzuki et al.	Aug 2003	A1
20030158855	Farnham et al.	Aug 2003	A1
20030177422	Tararoukhine et al.	Sep 2003	A1
20030184587	Ording et al.	Oct 2003	A1
20030210281	Ellis et al.	Nov 2003	A1
20030212680	Bates et al.	Nov 2003	A1
20030212710	Guy	Nov 2003	A1
20030222915	Marion et al.	Dec 2003	A1
20030225796	Matsubara	Dec 2003	A1
20030227487	Hugh	Dec 2003	A1
20030233419	Beringer	Dec 2003	A1
20040001106	Deutscher et al.	Jan 2004	A1
20040002993	Toussaint et al.	Jan 2004	A1
20040003247	Fraser et al.	Jan 2004	A1
20040008226	Manolis et al.	Jan 2004	A1
20040019584	Greening et al.	Jan 2004	A1
20040019655	Uemura et al.	Jan 2004	A1
20040030731	Iftode et al.	Feb 2004	A1
20040044696	Frost	Mar 2004	A1
20040044776	Larkin	Mar 2004	A1
20040054674	Carpenter et al.	Mar 2004	A1
20040056896	Doblmayr et al.	Mar 2004	A1
20040068524	Aboulhosn et al.	Apr 2004	A1
20040070612	Sinclair et al.	Apr 2004	A1
20040083433	Takeya	Apr 2004	A1
20040085581	Tonkin	May 2004	A1
20040088374	Webb et al.	May 2004	A1
20040091175	Beyrouti	May 2004	A1
20040098370	Garland et al.	May 2004	A1
20040098379	Huang	May 2004	A1
20040098742	Hsieh et al.	May 2004	A1
20040103280	Balfanz et al.	May 2004	A1
20040117358	Von Kaenel et al.	Jun 2004	A1
20040133572	Bailey et al.	Jul 2004	A1
20040133588	Kiessig et al.	Jul 2004	A1
20040148434	Matsubara et al.	Jul 2004	A1
20040153451	Phillips et al.	Aug 2004	A1
20040153968	Ching et al.	Aug 2004	A1
20040167942	Oshinsky et al.	Aug 2004	A1
20040177116	McConn et al.	Sep 2004	A1
20040177148	Tsimelzon, Jr.	Sep 2004	A1
20040177319	Horn	Sep 2004	A1
20040183824	Benson et al.	Sep 2004	A1
20040189704	Walsh et al.	Sep 2004	A1
20040189707	Moore et al.	Sep 2004	A1
20040193594	Moore et al.	Sep 2004	A1
20040193600	Kaasten et al.	Sep 2004	A1
20040193621	Moore et al.	Sep 2004	A1
20040193672	Samji et al.	Sep 2004	A1
20040193673	Samji et al.	Sep 2004	A1
20040199507	Tawa	Oct 2004	A1
20040205168	Asher	Oct 2004	A1
20040205625	Banatwala et al.	Oct 2004	A1
20040205633	Martinez et al.	Oct 2004	A1
20040205698	Schliesmann et al.	Oct 2004	A1
20040215600	Aridor et al.	Oct 2004	A1
20040220899	Barney et al.	Nov 2004	A1
20040223057	Oura et al.	Nov 2004	A1
20040225650	Cooper et al.	Nov 2004	A1
20040230572	Omoigui	Nov 2004	A1
20040230599	Moore et al.	Nov 2004	A1
20040230917	Bales et al.	Nov 2004	A1
20040249902	Tadayon et al.	Dec 2004	A1
20040255048	Lev Ran et al.	Dec 2004	A1
20050004928	Hamer et al.	Jan 2005	A1
20050010860	Weiss et al.	Jan 2005	A1
20050015405	Plastina et al.	Jan 2005	A1
20050027757	Kiessig et al.	Feb 2005	A1
20050050470	Hudson et al.	Mar 2005	A1
20050055306	Miller et al.	Mar 2005	A1
20050080807	Beilinson et al.	Apr 2005	A1
20050097477	Camara et al.	May 2005	A1
20050114672	Duncan et al.	May 2005	A1
20050120242	Mayer et al.	Jun 2005	A1
20050131903	Margolus et al.	Jun 2005	A1
20050131905	Margolus et al.	Jun 2005	A1
20050149481	Hesselink et al.	Jul 2005	A1
20050166159	Mondry et al.	Jul 2005	A1
20050171947	Gautestad	Aug 2005	A1
20050192953	Neale et al.	Sep 2005	A1
20050192966	Hilbert et al.	Sep 2005	A1
20050243993	McKinzie et al.	Nov 2005	A1
20050246331	De Vorchik et al.	Nov 2005	A1
20050246643	Gusmorino et al.	Nov 2005	A1
20050246664	Michelman et al.	Nov 2005	A1
20050256909	Aboulhosn et al.	Nov 2005	A1
20050257169	Tu	Nov 2005	A1
20050283476	Kaasten et al.	Dec 2005	A1
20060004692	Kaasten et al.	Jan 2006	A1
20060020586	Prompt et al.	Jan 2006	A1
20060036568	Moore et al.	Feb 2006	A1
20060080308	Carpentier et al.	Apr 2006	A1
20060129627	Phillips et al.	Jun 2006	A1
20060173873	Prompt et al.	Aug 2006	A1
20060200466	Kaasten et al.	Sep 2006	A1
20060200832	Dutton	Sep 2006	A1
20060218122	Poston et al.	Sep 2006	A1

Foreign Referenced Citations (6)

Number	Date	Country
1421800	Nov 2001	CN
2329492	Mar 1999	GB
9938092	Jul 1999	WO
9938092	Jul 1999	WO
WO 0225420	Mar 2002	WO
WO 2004107151	Sep 2004	WO

Related Publications (1)

	Number	Date	Country
	20040193672 A1	Sep 2004	US

Continuation in Parts (1)

	Number	Date	Country
Parent	10403174	Mar 2003	US
Child	10691841		US

System and method for virtual folder sharing including utilization of static and dynamic lists

Information

Patent Number

Date Filed

Date Issued

Inventors

Original Assignees

Examiners

Agents

CPC

US Classifications

Field of Search

US

International Classifications

Term Extension