Abstract: Provided is a method of hiding a specified directory with no effect on compatibility with an existing file system. According to an aspect of the invention, an apparatus for managing a hidden area includes a hidden area generation unit which sets a portion of the data area as a hidden area and records meta data for the set hidden area, a hidden area release unit which moves a directory entry of a root directory of the hidden area into the directory entry area and returns a cluster recorded with the meta data to release the set hidden area, and an access control unit which controls an access to the hidden area when the hidden area is set.

Abstract: A computer readable storage medium includes executable instructions to define a first information object, where the first information object is operative to perform a first function when associated with a first system, and a second function when associated with a second system. A set of properties for the first information object is defined. The set of properties are divided into a first set of properties for when the first information object is in the first system, and a second set of properties when the first information object is in the second system.

Abstract: A process that ensures the virtual destruction of data files a user wishes to erase from a storage medium, such as a hard drive, flash drive, or removable disk. This approach is appropriate for managing custom distributions from a large file sets as it is roughly linear in compute complexity to the number of files erased but is capped when many files are batch erased.

Abstract: To provide a technique of writing data efficiently on a storage medium and thereby play back a content continuously. Specifically, the file allocation table (FAT) of a storage medium is supposed to be read on a partial FAT basis and data is written by a preferred method for that reading method. A data processor writes a content data stream on a storage medium, on which a data storage location is defined based on a file allocation table (FAT).

Abstract: To avoid the need for storing a tree quota identifier attribute for every file in a quota tree, a tree quota identifier is included in the file handle returned by the file server to a client in response to a directory lookup request. The file server discovers that the file is in a quota tree when searching along a path specified by the file pathname and finding a directory having a tree quota identifier. The file server responds to a client request for changing the storage resources used by the file by inspecting the file handle and upon finding the tree quota identifier in the file handle, using the tree quota identifier to index a tree quota database to find usage and limits for the tree quota. The file server checks the limits against any increase in the storage resources for the file, and updates the usage.

Abstract: An exemplary embodiment of the invention relates to a method, system, and storage medium for providing a dynamic multi-dimensional commodity modeling process. The system includes a data collection component operable for collecting raw data, a dynamic multi-dimensional commodity model component, and a commodity tree generated by the dynamic multi-dimensional commodity model component. The system also includes a closed loop/corrective action component operable for resolving nonconformance issues resulting from analysis of the raw data and commodity tree, and an analytic engine in communication with the data collection component, the multi-dimensional commodity model component, and the closed loop/corrective action component.

Abstract: An XML wrapper queries an XML document in an on-the-fly manner so that only parent nodes in the document that satisfy the query are extracted and then unnested. The parent nodes and associated descendent nodes are located using XPath expressions contained as options in data definition language (DDL) statements. The parent nodes satisfying the query and associated descendent nodes are extracted and stored outside of a database according to a relational schema. The wrapper facilitates applications that use convention SQL queries and views to operate on that information stored according to the relational schema. The wrapper also responds to query optimizer requests for costs associated with queries against external data sources associated with the wrapper.

Abstract: According to an embodiment of the present invention, a filer or other storage server is coupled to a network to store files for users of the network. An agent is coupled to the filer, and performs a scan or file walk for a Multi-Appliance Management Application (MMA) which is coupled to the filer and can monitor and manage the filer. The agent assigns identification (ID) numbers to the directories while scanning them. The ID numbers are assigned in a depth first search (DFS) order to reduce the amount of resources required for specific queries that may later be required. Several types of queries, including determining the parent of a node, determining all of the children of a node, determining the immediate children of a node, and determining all of the ancestors of a node may be easily accomplished using the ID numbers.

Abstract: Certain embodiments of the present invention provide an archive management application that operates within a host application to provide access to an archive and/or allow access to and/or modification of files in an archive using the host application's interface, instead of operating as a separate standalone archive management application. In an embodiment of the present invention, a file archiving system may include a user interface component, a file management component and a compression/extraction engine component. The user interface component may include an enhanced user interface of a host application that provides an interface for a user. The file management component may include a central directory that provides a representation of the contents of an archive. The compression/extraction engine component may include a file size module and/or a security module. The file size module may be used to compress and/or decompress a file in an archive.

Abstract: A computerized method provides for an in-place transformation of matrix A data including a New Data Structure (NDS) format and a transformation T having a compact representation. The NDS represents data of the matrix A in a format other than a row major format or a column major format, such that the data for the matrix A is stored as contiguous sub matrices of size MB by NB in an order predetermined to provide the data for a matrix processing. The transformation T is applied to the MB by NB blocks, using an in-place transformation processing, thereby replacing data of the block A1 with the contents of T(A1).

Abstract: In general, techniques are described of enabling a client-based web browser application to browse a directory structure provided by a server on a private network via a secure gateway. In particular, an intermediate gateway device is positioned on a network path between the client device and a server device. The gateway device communicates with the client device via a secure network connection (e.g., a Secure Sockets Layer connection). When the gateway device receives a resource identifier that identifies a directory structure from either the client device or the server device, the gateway device alters the resource identifier. In particular, the gateway device alters the resource identifier in such a way that when the client device transmits a request to view the directory structure identified by the resource identifier, the client device transmits a request to view the directory structure in a networking protocol that the gateway device permits to pass through the gateway device.

Abstract: An application program interface (API) embodied on one or more computer readable media, comprising a first group of services related to integrating content repositories into virtual content repositories (VCRs), a second group of services related to manipulating information in VCRs, a third group of services related to searching VCRs, a forth group of services related to configuring VCRs, and wherein the application program interface is compatible with a content repository service provider interface (SPI).

Abstract: A memory system includes a nonvolatile semiconductor memory and a controller which controls the semiconductor memory, the memory system being inserted into the host device. The host device further includes a file management system which allocates a cluster defined in a FAT file system to write data and manages the data allocated to the cluster by using management data including a file allocation table defined in the FAT file system and a directory entry. The directory entry includes a root directory entry serving as entry information of a root directory of an uppermost layer and a sub-directory entry serving as entry information of a sub-directory belonging to the root directory. The file system allocates the plurality of clusters in a predetermined range in which addresses are serial to the management data.

Abstract: A method is disclosed for distribution of resources to network nodes in a decentralized data network. In at least one embodiment of the method keywords, which are allocated to digital resources, are mapped onto digital bit sequences. These bit sequences are modified, with the subsequent bits after a predetermined bit position, preferably being replaced by random bits. A mapping onto bit sequences is then undertaken with these modified bit sequences, with each network node being responsible for a specific range of values of indices. The resource will then be allocated the index which is produced by the mapping. The mapping in this case can be selected so that a wildcard search according to keywords is guaranteed. The outstanding feature of the method is that the resources are distributed evenly in the decentralized network and at the same time a fast wildcard search according to truncated keywords is made possible.

Abstract: A data structure having at least content data and reproduction control information with which reproduction of the content data is controlled is disclosed. The data structure includes an index table, an object, a play list, and clip information. With the index table, reproduction of content data is managed. The object is called to the index table and represents a method of reproducing at least the content data. The play list is called from the object. The clip information is called based on the play list and represents attribute information of at least the content data. At least the index table, the play list, and the clip information each are capable of containing extension data. The extension data contain main identification information and sub identification information as identification information which identities the extension data.

Abstract: The number of index entries in a grid index for indexing geometric shapes is reduced by establishing a pool storage area for geometric shapes, selecting a threshold number of grid cells which a geometric shape may overlap, storing the shape in the grid index if a geometric shape overlaps a number of grid cells not exceeding the threshold number, and storing the shape in the pool storage area if the geometric shape overlaps a number of grid cells which exceeds the threshold number.

Abstract: Systems and methods for data classification to facilitate and improve data management within an enterprise are described. The disclosed systems and methods evaluate and define data management operations based on data characteristics rather than data location, among other things. Also provided are methods for generating a data structure of metadata that describes system data and storage operations. This data structure may be consulted to determine changes in system data rather than scanning the data files themselves.

Abstract: According to one embodiment, an electronic apparatus includes a wireless communication device, an information acquisition module, a file management information generation module, and an access control module. The information acquisition module acquires, by wireless communication with an external device, metadata corresponding to content data which the external device can provide. The file management information generation module generates, based on the acquired metadata, file management information based on which a host apparatus recognizes the content data as a file stored in a storage medium in the electronic apparatus. The access control module is configured to, upon receiving a read request for a file corresponding to the content data, which is transmitted from the host apparatus, execute external device access processing of acquiring the content data from the external device using the wireless communication device, and output the acquired content data to the host apparatus.

Abstract: A data providing system of the present invention is provided with an image acquiring device, an area extracting device, a data storing device, and a data providing device. For each image data acquired by the image acquiring device, a storage destination specifying area is extracted by the area extracting device, storage destination is specified by a storage destination specifying device, and the image data is stored at the storage destination by the data storing device.

Abstract: A NAS switch provides large file support to a file server in a decentralized storage network such as a NAS (Network Attached Storage) storage network. For example, files greater than 2-GB can be stored on a 32-bit commodity file server. The NAS switch sits in the data path of a client on the front end and a commodity NAS file server on the back end. A segmentation module in the NAS switch stores large files as separate data chunks in the file server. To do so, the segmentation module stores a directory file handle, which points to a directory containing the data chunks, in place of the large file. The segmentation module can also store a large file/chunk directory association in a migration cache. A reconstruction module processes client requests concerning large files by issuing requests to specific data chunks. For example, in a read operation, the reconstruction module calculates chunk numbers to determine which file to read and offsets to determine which byte to read within a chunk.

Abstract: System and method for managing a plurality of clients. A request to implement a change in configuration data is received from a user. The configuration data relates to an operation of a client. The received request is stored in a memory area. Computer-executable instructions request topology data from the memory area based on the configuration data to identify the client. The requested topology data is received from the memory area. Computer-executable instructions identify a notification service associated with the client and notify the identified notification service of the change in the configuration data.

Abstract: A method, an apparatus, a computer program product, and a data processing system provide for operation of a virtual machine with embedded functionality for interoperating with other virtual machines in a computational grid. A plurality of virtual machines are run on one or more devices within a data processing system; each virtual machine in the plurality of virtual machines incorporates functionality for interoperating and associating with other virtual machines in a virtual machine cluster in a grid-like manner. Each virtual machine in the virtual machine cluster acts as a node within the virtual machine cluster. A virtual machine manages its objects in association with an object group, and each virtual machine may manage multiple object groups. The virtual machines share information such that the object groups can be moved between virtual machines in the virtual machine cluster, thereby allowing the virtual machine cluster to act as one logical virtual machine.

Abstract: A method and system that allows efficient shredding of large instances of hierarchical data structures into relational data structures. Large instances of hierarchical data structures, which are able to be larger than the random access storage of a computer used to shred them into relational data structures, are incrementally shredded into a temporary storage. When the amount of data shredded into the temporary storage reaches or exceeds a predetermined commit count, the data in the temporary storage is transferred to a relational data structure maintained by a relational database manager. A Document Type Description annotation is provided to allow the end user to specify execution order for SQL commands and to specify commit count values.

Abstract: Two objects are identified. A relationship between the two objects is determined. A contract object is used to represent the relationship between the objects. The contract is useful in many applications: for example, file systems, relational databases, and spreadsheets. The contract can also have rules for processing events occurring to either of the objects related by the contract.

Abstract: A method and data structure for separating application data from user data in a namespace. The data structure provides an intuitive profile layout for developers or users while supporting legacy applications. The namespace utilizes a hierarchical structure allowing access by developers or users over a network to information contained in identified public folders and/or a user's profile.

Abstract: An approach is provided for determining related queries for a given search query based on the linking structure of electronic documents within a document set. Document titles are used to represent potential search queries and links between the electronic documents are used to determine relationships between the potential search queries. As such, the document set may be represented as a directed graph in which document titles (which represent potential search queries) are nodes and links are edges between the nodes. When a particular search query is received, a corresponding node is identified and related queries are determined by identifying other nodes having connections with that node.

Abstract: The present invention is a method of obtaining information regarding an individual's environment using a programmable device. The first step of the method is sensing a psychomotor behavioral element of an activity engaged by the individual. The type of activity engaged by the individual can be any sensible activity under the sun, including breathing, thinking, generating heat, etc. The next step in the inventive method is determining the preferred modalities of the individual based on the psychomotor behavioral element of the activity engaged by the individual. Provided herein are calculations used for determining the preferred modalities of the individual based on the psychomotor behavioral element of the activity. In the present context, the preferred modalities are the semi-conscious or nonconscious desires of the individual, indicated by nonconscious actions, to experience her environment in a specific manner. The information obtained by the inventive method can be used in several ways.

Abstract: A heap management system for a database uses “sets” of pages to store database information. As memory for each successive set of pages is allocated, more memory is allocated for storing rows in each page of the set. Similarly, the maximum number of rows of information storable in each page of each set is greater for each successive set of pages. The number of computer instructions needed to resolve (or calculate) the memory address for a particular row is fixed. Given a target row number, (and the number of rows in the first page, and the width of the column or column group), only a fixed number of computer instructions need to be executed to resolve the starting memory address for the target row. In addition, information of the same type (i.e., one or more columns of a table) may be stored in different pages, and these pages may be located in discontiguous memory segments. This allows space for new rows to be allocated, without requiring all pre-existing rows to be moved to a different memory segment.

Abstract: A system implementable using a programmable processor includes a plurality of pre-stored commands for building an inventory of audio, musical, works or audio/visual works, such as music videos. A plurality of works can be collected together in a list for purposes of establishing a play or a presentation sequence. The list can be visually displayed and edited. A plurality of lists can be stored for subsequent retrieval. A selected list can be retrieved and executed. Upon execution, the works of the list are presented sequentially either audibly or visually. The works can be read locally from a source, such as a CD, or can be obtained, via wireless transmission, from a remote inventory. If desired, establishment of a predetermined credit can be a pre-condition to being able to add items to the list for presentation.

Abstract: Provided are a method and apparatus for supporting a symbolic link at an application level while keeping the structure of an existing file system that does not support a symbolic link. The method includes receiving a symbolic link creation command including an absolute path and a symbolic link path from a user, creating a symbolic link file for the symbolic link path when the absolute path exists but the symbolic link path does not exit, and changing a value of a specified field of a directory entry of the created symbolic link file to a specified value representing the symbolic link.

Abstract: The data structure on the recording medium includes a navigation area storing an information file. The information file includes a first playback indicator that identifies a navigation command field for execution at first playback of the recording medium. The identified navigation command field is also stored on the recording medium, and the identified navigation command field includes at least one navigation command.

Abstract: A content management system includes a conversion a section, a display data storing section, a field section, an operation section and a management section. The conversion section converts content data into display data which is to be written into an electronic paper. The display data storing section stores the display data. The field storing section stores field data which includes identification information of a first user belonging to a field and identification information of the display data. The operation section accepts a request from a second user. The management section that allows, when the identification information of the first user contained in the field data coincides with identification information of the second user contained in the request accepted by the operation section, the display data indicated by the identification information contained in the field data to be written into the electronic paper.

Abstract: An information management device, including a memory that stores actual information and reference information referring to the actual information; a setting unit that sets to inhibit creation of reference information, regarding with actual information for which creation of reference information is to be inhibited; a receiving unit that receives a request for creation of reference information for referring to actual information; and a control unit that controls to inhibit the requested creation of the reference information, regarding with the actual information for which the creation of the reference information is set to be inhibited.

Abstract: Systems and methods responsive to a data file deletion instruction are disclosed. A method includes receiving an instruction to delete a data file. The data file is stored at a plurality of persistent memory cells of a memory. The memory also stores a directory that includes a first entry corresponding to the data file. In response to receiving the instruction to delete the data file, multiple attribute bits of the first entry are programmed and also a first bit of the first entry is programmed. The first bit of the first entry is distinct from the multiple attribute bits. Programming the multiple attribute bits converts the first entry from a first entry type to a second entry type. Programming the first bit of the first entry indicates that the first entry has an unused status.

Abstract: A memory device and method for content virtualization are disclosed. In one embodiment, a plurality of directories are created in the memory of the memory device, wherein each of the plurality of directories points to a same storage location of the digital content. In another embodiment, a first header for the digital content is stored in each of the different directories, wherein the first header comprises information about where to find the digital content in the memory. In yet another embodiment, the memory device comprises circuitry that receives an identification of a host device in communication with the memory device and reorganizes a directory structure of the memory in accordance with the identification of the host device, wherein the reorganization results in the digital content appearing to be located in a directory expected by the host device.

Abstract: A method (800) of displaying one or more data attributes, is disclosed. The displayed data attributes is associated with one or more portions of data. The method (800) dynamically compiles a list of one or more data attribute types according to an analysis of the one or more portions of data and associated data attributes. The one or more data attributes are then displayed.

Abstract: The invention relates to a method for updating a remote data base with sets of data of a master data base system. The sets of data are forwarded to an intermediate data base, and the intermediate data base and the remote data base system are coupled by means of a synchronisation protocol. The protocol ensures, that the remote data base is reliably updated, wherein said master data base and said intermediate data base are logically independent data bases each part of a unique data base system controlled by a unique data base management, and also to master data base system therefore.

Abstract: Systems and methods are provided for scanning files and directories in a distributed file system on a network of nodes. The nodes include metadata with attribute information corresponding to files and directories distributed on the nodes. In one embodiment, the files and directories are scanned by commanding the nodes to search their respective metadata for a selected attribute. At least two of the nodes are capable of searching their respective metadata in parallel. In one embodiment, the distributed file system commands the nodes to search for metadata data structures having location information corresponding to a failed device on the network. The metadata data structures identified in the search may then be used to reconstruct lost data that was stored on the failed device.

Abstract: A method is disclosed for facilitating visualisation of status data in an electronic system. The status data comprises metadata including a plurality of information context categories. The status data also comprises data nodes, each data node including specific instances of a respective context category. The method starts with selecting possible data combinations and permutations of the information context categories, each permutation defining a respective hierarchy. For each permutation, information content of data for each node of the respective hierarchy is estimated and an informative tree and total entropy for all informative nodes are found. The permutation and the informative tree that has the lowest total entropy are then presented to the user.

Abstract: The present invention provides a technique for efficiently generating and validating external file handles at a storage operating system of a filer. According to one aspect of the technique, the storage operating system associates a unique internal file handle with each file or directory stored in the filer. This unique internal file handle is used to generate a corresponding external file handle. Unlike previous approaches, the internal file handles' representations do not change depending on the location of their corresponding files or directories, e.g., on-disk or in-core, within the filer, thereby simplifying file management within the filer. According to another aspect of the inventive technique, the filer executes a file-handle validation procedure to determine whether an external file handle received with a file access request has become invalid (or “stale”) as a result of an NVRAM failure in the filer.

Abstract: An information recording/reproducing apparatus is disclosed which includes: a recording section for recording files to a storage medium; an arranging section for arranging the files into groups by attribute so as to establish allocation of the files on the storage medium; and a controlling section for controlling the recording section so as to record the files to the storage medium based on the allocation established by the arranging section and to record concurrently allocation information reflecting the allocation to a predetermined location on the storage medium.

Abstract: The subject matter disclosed herein provides methods and apparatus, including computer program products, for determining keys for use with data structures, such as objects, business objects, view business objects, and the like. In one aspect, there is provided a computer-implemented method. The method may include determining a first key of a view business object node by combining one or more keys of the business object nodes used to form the view business object node, the first key used to identify the view business object node when the view business object node is a root node. The method may also include determining, when the view business object node has a parent node, a second key of the view business object node by combining the first key and at least one key of the parent node, the second key used to identify the view business object node.

Abstract: A recording medium in which a left-view video stream and a right-view video stream are recorded in an interleaved transport stream file. The interleaved transport stream file is identified by a combination of (i) an equivalent identification number being equivalent with the file reference information and (ii) a file extension indicating that video streams are stored in the interleaved manner, the equivalent identification number. Among Extents that constitute the interleaved transport stream file, Extents constituting the left-view or right-view video stream are identified as a normal-format transport stream file by a combination of (i) the equivalent identification number being equivalent with the file reference information and (ii) a file extension indicating that video streams are stored in a normal manner.

Abstract: A system and method of providing efficient management of distributed, diversified, large sized spatial data as a scalable solution. The system and method are based on the combination of the following: Distributed spatial data is managed by spatial data servers which are deployed next to each spatial data source that needs to be accessed allowing spatial data to remain in the location where it was created. Spatial data indices allow fast delivery of large spatial data sets and are automatically updated whenever spatial data sets are modified. Spatial meta servers coordinate the spatial data servers, publish the existence of the spatial data, define access permissions and communicate with other spatial meta severs extending the spatial data connectivity into other networks. Spatial data providers deployed next to each location requiring access to the spatial data allow spatial data to be discovered and accessed directly from the spatial data servers.

Abstract: The number of index entries in a grid index for indexing geometric shapes is reduced by establishing a pool storage area for geometric shapes, selecting a threshold number of grid cells which a geometric shape may overlap, storing the shape in the grid index if a geometric shape overlaps a number of grid cells not exceeding the threshold number, and storing the shape in the pool storage area if the geometric shape overlaps a number of grid cells which exceeds the threshold number.

Abstract: Method and system for retrieving and sorting data entries in a directory is provided. A unique predetermined identifier is stored in a directory. The unique predetermined identifier is assigned as a relative distinguished name (RDN) for at least two entries, where the unique predetermined identifier is monotonically increased for each entry.

Abstract: A method of facilitating the entry of text into a new message generated by a messaging application of a handheld electronic device is provided that includes receiving a command to reply to or forward a received message that is included within a message thread, scanning the message thread, identifying a plurality of words in the message thread, generating one or more word lists that include the identified words, and displaying the one or more word lists. The method further includes receiving a selection of a selected one of the words from the one or more word lists, and entering the selected one of the words into the new message. Also provided is an improved handheld electronic device that implements the described method.

Abstract: A system and method of deleting rows from a database directory table is provided. In one aspect, candidate rows to delete from a database directory table are identified. An image copy of the database directory table is created and the candidate rows are updated for deletion in the image copy. A recover module or utility recovers the database directory table from the updated image copy.

Abstract: A method of managing local and remote data storage including displaying to a user, as a single logical volume, file names referencing both local data files and remote data files. The user individually selects file names and assigns a location attribute to the file names: residing only on the remote data storage, residing only the local data storage; residing on both the local data storage and the remote data storage. The location attribute of residing only on the remote data storage causes the local data file to be erased. The location attribute of residing only on the local data storage causes the remote data file to be erased. The location attribute, of residing on both the local data storage and the remote data storage, causes the files to be synchronized.

Abstract: An application program interface (API) provides means for dynamic filesystem creation, that allows complex filesystem hierarchies to be created and written on-the-fly without having to generate a complete on-disk representation. The filesystem is laid out in a one-parent many-children hierarchy of file and folder objects. The API recursively traverses the filesystem hierarchy beginning at the root node to determine the filesystem's structure. Callback functions for retrieval of file data are determined for each filesystem object and stored in memory. Output blocks are allocated for file data as needed. During the writing phase, the callback functions are executed to retrieve file data which is then written to the desired computer readable media.