公开(公告)号：US06922698B2

公开(公告)日：2005-07-26

申请号：US10464293

申请日：2003-06-17

申请人： Mark S. Day ,  Donald J. Brady ,  Deric S. Horn

发明人： Mark S. Day ,  Donald J. Brady ,  Deric S. Horn

IPC分类号： G06F12/00 ,  G06F17/30

CPC分类号： G06F17/30091 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99935 ,  Y10S707/99943

摘要： A system and method for interfacing index based and iterator based file management routines. In general, the disclosed system maintains an iterator cache having multiple iterators. Each active iterator is associated with a most recently used directory entry. Upon receiving an index based request, the iterator closest to the index based request is identified. If the index based request is closer to the top of the directory than it is to the closest active iterator, the directory entries are sequentially examined beginning at the top of the directory with the first entry. Otherwise, the system determines whether the index based request is located above or below the closest iterator. If the index based request is above the closest iterator, the system steps backward beginning with the directory entry associated with the closest iterator until the directory entry associated with the index based request is located. If the closest iterator is located below the closest iterator, the system steps forward through the directory entries beginning with the directory entry associated with the closest iterator until the requested directory entry is located.

摘要翻译： 一种用于基于索引和基于迭代器的文件管理例程的系统和方法。 通常，所公开的系统维护具有多个迭代器的迭代器高速缓存。 每个活动迭代器与最近使用的目录条目相关联。 在接收到基于索引的请求时，识别最接近基于索引的请求的迭代器。 如果基于索引的请求比最接近的活动迭代器更接近目录的顶部，则从目录的顶部开始，首先从第一个条目开始检查目录条目。 否则，系统确定基于索引的请求是否位于最接近的迭代器之上或之下。 如果基于索引的请求高于最接近的迭代器，则系统将从与最近的迭代器相关联的目录条目向后开始，直到找到与基于索引的请求相关联的目录条目。 如果最接近的迭代器位于最接近的迭代器之下，则系统将从与最近迭代器相关联的目录条目开始的目录条目向前移动，直到找到所请求的目录条目。

公开(公告)号：US06249782B1

公开(公告)日：2001-06-19

申请号：US09213201

申请日：1998-12-17

申请人： Mark S. Day ,  Donald J. Brady ,  Deric S. Horn

发明人： Mark S. Day ,  Donald J. Brady ,  Deric S. Horn

IPC分类号： G06F1730

CPC分类号： G06F17/30067 ,  Y10S707/99932 ,  Y10S707/99943

摘要： A system and method are disclosed for reducing file names and for retrieving files having reduced file names. In response to a request to access file names that are not supportable by an applications programming interface (API), a file manager program retrieves an original file name having an original file name length and an original file identifier. Next, the file manager divides the original file name into a set of primary characters and a set of extension characters. A shortened identifier having a set of shortened identifier characters is created by encoding the original file identifier. The primary characters are then truncated. A reduced file name is then created by combining the truncated characters, a reduced file name marker, the shortened identifier, and the extension characters. Files having reduced names are retrieved by a file manager that identifies a set of shortened identifier characters in a reduced file name, decodes the shortened identifier characters, and retrieves a file based on the decoded identifier characters from a data volume.

摘要翻译： 公开了一种用于减少文件名和用于检索具有减小的文件名的文件的系统和方法。 响应于访问不能由应用程序编程接口（API）支持的文件名的请求，文件管理程序检索具有原始文件名长度和原始文件标识符的原始文件名。 接下来，文件管理器将原始文件名分为一组主要字符和一组扩展名字符。 通过对原始文件标识符进行编码来创建具有缩短的标识符字符集的缩短标识符。 然后，主要字符被截断。 然后通过组合截断的字符，缩小的文件名标记，缩短的标识符和扩展字符来创建缩小的文件名。 具有减少名称的文件由文件管理器检索，该文件管理器识别缩减文件名中的一组缩短的标识符字符，对缩短的标识符字符进行解码，并且根据来自数据卷的解码的标识符字符来检索文件。

公开(公告)号：US07801906B2

公开(公告)日：2010-09-21

申请号：US11360797

申请日：2006-02-22

申请人： Mark S. Day ,  Donald J. Brady ,  Deric S. Horn

发明人： Mark S. Day ,  Donald J. Brady ,  Deric S. Horn

IPC分类号： G06F7/00 ,  G06F17/30

CPC分类号： G06F17/30067 ,  Y10S707/99933 ,  Y10S707/99954

摘要： The invention receives a request to store a file having a filename written in a first text encoding, converts the filename into a Unicode filename and stores the Unicode filename and the file into memory. The invention then sets a flag, associated with the memory, indicating that a first text encoding has been used. To retrieve a Unicode filename, the invention receives a request to locate a Unicode filename from memory. Next, the invention uses a predetermined text encoding to convert the filename into Unicode. The invention then searches for the Unicode filename in the memory. If the Unicode filename is not found, the invention uses a next text encoding from the set of text encodings which have been used, to repeat the conversion and searches the memory until the Unicode filename is identified. Lastly, the Unicode file is retrieved.

摘要翻译： 本发明接收到存储具有以第一文本编码编写的文件的文件的请求，将文件名转换为Unicode文件名，并将Unicode文件名和文件存储到存储器中。 然后，本发明设置与存储器相关联的标志，指示已经使用第一文本编码。 要检索Unicode文件名，本发明接收到从内存中查找Unicode文件名的请求。 接下来，本发明使用预定的文本编码将文件名转换为Unicode。 然后，本发明在存储器中搜索Unicode文件名。 如果未找到Unicode文件名，本发明使用已经使用的一组文本编码中的下一个文本编码，重复转换并搜索内存，直到识别出Unicode文件名。 最后，检索Unicode文件。

公开(公告)号：US06434574B1

公开(公告)日：2002-08-13

申请号：US09213199

申请日：1998-12-17

申请人： Mark S. Day ,  Donald J. Brady ,  Deric S. Horn

发明人： Mark S. Day ,  Donald J. Brady ,  Deric S. Horn

IPC分类号： G06F1730

CPC分类号： G06F17/30067 ,  Y10S707/99933 ,  Y10S707/99954

摘要： The invention receives a request to store a file having a filename written in a first text encoding, converts the filename into a Unicode filename and stores the Unicode filename and the file into memory. The invention then sets a flag, associated with the memory, indicating that a first test encoding has been used. To retrieve a Unicode filename, the invention receives a request to locate a Unicode filename from memory. Next, the invention uses a predetermined text encoding to convert the filename in to Unicode. The invention then searches for the Unicode filename in the memory. If the Unicode filename is not found, the invention uses a next text encoding from the set of text encodings which have been used, to repeat the conversion and searches the memory until the Unicode filename is identified. Lastly, the Unicode file is retrieved.

摘要翻译： 本发明接收到存储具有以第一文本编码编写的文件的文件的请求，将文件名转换为Unicode文件名，并将Unicode文件名和文件存储到存储器中。 然后，本发明设置与存储器相关联的标志，指示已经使用第一测试编码。 要检索Unicode文件名，本发明接收到从内存中查找Unicode文件名的请求。 接下来，本发明使用预定的文本编码将文件名转换为Unicode。 然后，本发明在存储器中搜索Unicode文件名。 如果未找到Unicode文件名，本发明使用已经使用的一组文本编码中的下一个文本编码，重复转换并搜索内存，直到识别出Unicode文件名。 最后，检索Unicode文件。

公开(公告)号：US07991781B2

公开(公告)日：2011-08-02

申请号：US11648055

申请日：2006-12-28

申请人： Mark S. Day ,  Donald J. Brady ,  Deric S. Horn

发明人： Mark S. Day ,  Donald J. Brady ,  Deric S. Horn

IPC分类号： G06F17/30

CPC分类号： G06F17/30067 ,  Y10S707/99933 ,  Y10S707/99954

摘要： The invention receives a request to store a file having a filename written in a first text encoding, converts the filename into a Unicode filename and stores the Unicode filename and the file into memory. The invention then sets a flag, associated with the memory, indicating that a first text encoding has been used. To retrieve a Unicode filename, the invention receives a request to locate a Unicode filename from memory. Next, the invention uses a predetermined text encoding to convert the filename into Unicode. The invention then searches for the Unicode filename in the memory. If the Unicode filename is not found, the invention uses a next text encoding from the set of text encodings which have been used, to repeat the conversion and searches the memory until the Unicode filename is identified. Lastly, the Unicode file is retrieved.

摘要翻译： 本发明接收到存储具有以第一文本编码编写的文件的文件的请求，将文件名转换为Unicode文件名，并将Unicode文件名和文件存储到存储器中。 然后，本发明设置与存储器相关联的标志，指示已经使用第一文本编码。 要检索Unicode文件名，本发明接收到从内存中查找Unicode文件名的请求。 接下来，本发明使用预定的文本编码将文件名转换为Unicode。 然后，本发明在存储器中搜索Unicode文件名。 如果未找到Unicode文件名，本发明使用已经使用的一组文本编码中的下一个文本编码，重复转换并搜索内存，直到识别出Unicode文件名。 最后，检索Unicode文件。

公开(公告)号：US07013314B2

公开(公告)日：2006-03-14

申请号：US10177715

申请日：2002-06-20

申请人： Mark S. Day ,  Donald J. Brady ,  Deric S. Horn

发明人： Mark S. Day ,  Donald J. Brady ,  Deric S. Horn

IPC分类号： G06F17/30

CPC分类号： G06F17/30067 ,  Y10S707/99933 ,  Y10S707/99954

摘要： The invention receives a request to store a file having a filename written in a first text encoding, converts the filename into a Unicode filename and stores the Unicode filename and the file into memory. The invention then sets a flag, associated with the memory, indicating that a first text encoding has been used. To retrieve a Unicode filename, the invention receives a request to locate a Unicode filename from memory. Next, the invention uses a predetermined text encoding to convert the filename into Unicode. The invention then searches for the Unicode filename in the memory. If the Unicode filename is not found, the invention uses a next text encoding from the set of text encodings which have been used, to repeat the conversion and searches the memory until the Unicode filename is identified. Lastly, the Unicode file is retrieved.

公开(公告)号：US06282536B1

公开(公告)日：2001-08-28

申请号：US09216602

申请日：1998-12-17

申请人： Mark S. Day ,  Donald J. Brady ,  Deric S. Horn

发明人： Mark S. Day ,  Donald J. Brady ,  Deric S. Horn

IPC分类号： G06F900

CPC分类号： G06F17/30091 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99935 ,  Y10S707/99943

摘要： A system and method for interfacing index based and iterator based file management routines. In general, the disclosed system maintains an iterator cache having multiple iterators. Each active iterator is associated with a most recently used directory entry. Upon receiving an index based request, the iterator closest to the index based request is identified. If the index based request is closer to the top of the directory than it is to the closest active iterator, the directory entries are sequentially examined beginning at the top of the directory with the first entry. Otherwise, the system determines whether the index based request is located above or below the closest iterator. If the index based request is above the closest iterator, the system steps backward beginning with the directory entry associated with the closest iterator until the directory entry associated with the index based request is located. If the closest iterator is located below the closest iterator, the system steps forward through the directory entries beginning with the directory entry associated with the closest iterator until the requested directory entry is located.

公开(公告)号：US07769785B2

公开(公告)日：2010-08-03

申请号：US11172077

申请日：2005-06-29

申请人： Mark S. Day ,  Donald J. Brady ,  Deric S. Horn

发明人： Mark S. Day ,  Donald J. Brady ,  Deric S. Horn

IPC分类号： G06F17/30

CPC分类号： G06F17/30091 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99935 ,  Y10S707/99943

摘要： A system and method for interfacing index based and iterator based file management routines. In general, the disclosed system maintains an iterator cache having multiple iterators. Each active iterator is associated with a most recently used directory entry. Upon receiving an index based request, the iterator closest to the index based request is identified. If the index based request is closer to the top of the directory than it is to the closest active iterator, the directory entries are sequentially examined beginning at the top of the directory with the first entry. Otherwise, the system deternines whether the index based request is located above or below the closest iterator. If the index based request is above the closest iterator, the system steps backward beginning with the directory entry associated with the closest iterator until the directory entry associated with the index based request is located. If the closest iterator is located below the closest iterator, the system steps forward through the directory entries beginning with the directory entry associated with the closest iterator until the requested directory entry is located.

摘要翻译： 一种用于基于索引和基于迭代器的文件管理例程的系统和方法。 通常，所公开的系统维护具有多个迭代器的迭代器高速缓存。 每个活动迭代器与最近使用的目录条目相关联。 在接收到基于索引的请求时，识别最接近基于索引的请求的迭代器。 如果基于索引的请求比最接近的活动迭代器更接近目录的顶部，则从目录的顶部开始，首先从第一个条目开始检查目录条目。 否则，系统确定基于索引的请求是否位于最接近的迭代器之上或之下。 如果基于索引的请求高于最接近的迭代器，则系统将从与最近的迭代器相关联的目录条目向后开始，直到找到与基于索引的请求相关联的目录条目。 如果最接近的迭代器位于最接近的迭代器之下，则系统将从与最近迭代器相关联的目录条目开始的目录条目向前移动，直到找到所请求的目录条目。

公开(公告)号：US06591268B2

公开(公告)日：2003-07-08

申请号：US10082426

申请日：2002-02-22

申请人： Mark S. Day ,  Donald J. Brady ,  Deric S. Horn

发明人： Mark S. Day ,  Donald J. Brady ,  Deric S. Horn

IPC分类号： G06F1730

CPC分类号： G06F17/30091 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99935 ,  Y10S707/99943

摘要： A system and method for interfacing index based and iterator based file management routines. In general, the disclosed system maintains an iterator cache having multiple iterators. Each active iterator is associated with a most recently used directory entry. Upon receiving an index based request, the iterator closest to the index based request is identified. If the index based request is closer to the top of the directory than it is to the closest active iterator, the directory entries are sequentially examined beginning at the top of the directory with the first entry. Otherwise, the system determines whether the index based request is located above or below the closest iterator. If the index based request is above the closest iterator, the system steps backward beginning with the directory entry associated with the closest iterator until the directory entry associated with the index based request is located. If the closest iterator is located below the closest iterator, the system steps forward through the directory entries beginning with the directory entry associated with the closest iterator until the requested directory entry is located.

公开(公告)号：US06405196B2

公开(公告)日：2002-06-11

申请号：US09866116

申请日：2001-05-25

申请人： Mark S. Day ,  Donald J. Brady ,  Deric S. Horn

发明人： Mark S. Day ,  Donald J. Brady ,  Deric S. Horn

IPC分类号： G06F1730

CPC分类号： G06F17/30091 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99935 ,  Y10S707/99943

摘要： A system and method for interfacing index based and iterator based file management routines. In general, the disclosed system maintains an iterator cache having multiple iterators. Each active iterator is associated with a most recently used directory entry. Upon receiving an index based request, the iterator closest to the index based request is identified. If the index based request is closer to the top of the directory than it is to the closest active iterator, the directory entries are sequentially examined beginning at the top of the directory with the first entry. Otherwise, the system determines whether the index based request is located above or below the closest iterator. If the index based request is above the closest iterator, the system steps backward beginning with the directory entry associated with the closest iterator until the directory entry associated with the index based request is located. If the closest iterator is located below the closest iterator, the system steps forward through the directory entries beginning with the directory entry associated with the closest iterator until the requested directory entry is located.

摘要翻译： 一种用于基于索引和基于迭代器的文件管理例程的系统和方法。 通常，所公开的系统维护具有多个迭代器的迭代器高速缓存。 每个活动迭代器与最近使用的目录条目相关联。 在接收到基于索引的请求时，识别最接近基于索引的请求的迭代器。 如果基于索引的请求比最接近的活动迭代器更接近目录的顶部，则从目录的顶部开始，首先从第一个条目开始检查目录条目。 否则，系统确定基于索引的请求是否位于最接近的迭代器之上或之下。 如果基于索引的请求高于最接近的迭代器，则系统将从与最近的迭代器相关联的目录条目向后开始，直到找到与基于索引的请求相关联的目录条目。 如果最接近的迭代器位于最接近的迭代器之下，则系统将从与最近迭代器相关联的目录条目开始的目录条目向前移动，直到找到所请求的目录条目。