We provide a benchmark collection of deterministic automata for regular XPath queries. For this, we select the subcollection of for- ward navigational XPath queries from a corpus that Lick and Schmitz extracted from real world XSLT and XQuery programs, compile them to symbolic stepwise hedge automata (SSHAs) and determinize them. Large blowups by automata determinization are avoided by using schema-based determinization. Therefore, we show how to lift a recent algorithm for schema-based determinization from SHAs to symbolic SHAs. Our col- lection also provides deterministic symbolic nested word automata, that we obtain by compilation from deterministic symbolic SHAs.