\begin{bsysitemize}
\item All fields are separated by a tab
-\item You can specify \texttt{limit=} and \texttt{offset=} to list smoothly
- records in very big directories
-\item All operations (except cache creation) are designed to run instantly
-\item At this time, Bvfs works faster on PostgreSQL than MySQL catalog. If you
- can contribute new faster SQL queries we will be happy, else don't complain
- about speed.
-\item The cache creation is dependent of the number of directories. As Bvfs
- shares information accross jobs, the first creation can be slow
-\item All fields are separated by a tab
-\item Due to potential encoding problem, it's advised to allways use pathid in
+\item You can specify \texttt{limit=} and \texttt{offset=} to quickly
+ obtain partial listings big directories.
+\item All operations (except cache creation) are designed to run very fast.
+\item The cache creation depends on the number of directories, and since Bvfs
+ shares information across jobs, the first creation can take some time.
+\item All fields returned are separated by a tab.
+\item Due to potential filename encoding problems, we recommend to always use pathid in
queries.
\end{bsysitemize}
To include a directory (with \texttt{dirid}), Bvfs needs to run a query to
select all files. This query could be time consuming.
-\texttt{hardlink} list is always composed of a serie of two numbers (jobid,
+\texttt{hardlink} list is always composed of a series of two numbers (jobid,
fileindex). This information can be found in the LinkFI field of the LStat
packet.