Indexing of database queries
View Patent ↗Making data available from a database is disclosed. Making data available includes specifying a query function having a query function name, wherein the query function includes a structure and a member, determining the structure and the member included in the query function, wherein the query function has a query function name and includes the structure and the member, creating an index for the structure on the member, and compiling the query function to be available to a user by invoking the query function name without the user having to specify the structure and the member. Retrieving data from a database is disclosed. Retrieving includes invoking a query function that specifies a plurality of structures and a value, accessing a cross index of the plurality of structures, and using the cross index to access the data.
1. A method of retrieving data from a DNS database, including:
invoking a query function for querying the DNS database using a processor, wherein the query function specifies a plurality of structures and a value; and wherein the DNS database includes a first structure and a second structure;
accessing a cross index of the plurality of structures, wherein a first member of the first structure is concatenated with a second member of the second structure to form a third member of the cross index; and wherein the cross index indexes a structure on a member that corresponds to the value;
using the cross index to access the data; and
automatically updating the cross index each time a write operation is performed that affects the cross index.
2. A method as recited in claim 1 , wherein the query function is specified in a cross index structure.
3. A method as recited in claim 1 , wherein the member includes a key of a structure, wherein the key uniquely identifies an object.
4. A method as recited in claim 1 , wherein the cross index includes a list of objects.
5. A method as recited in claim 1 , wherein the cross index includes a plurality of lists corresponding to each of the possible values of the member.
6. A method as recited in claim 1 , wherein the cross index includes a list of keys wherein each key uniquely identifies an object.
7. A method as recited in claim 1 , wherein the query function is specified in a markup language.
8. A method as recited in claim 1 , wherein the structure and the member are specified in a markup language.
9. A system for making data available from a DNS database, including:
a processor configured to:
invoke a query function for querying the DNS database, wherein the query function specifies a plurality of structures and a value; and wherein the DNS database includes a first structure and a second structure;
access a cross index of the plurality of structures, wherein a first member of the first structure is concatenated with a second member of the second structure to form a third member of the cross index; and wherein the cross index indexes a structure on a member that corresponds to the value;
use the cross index to access the data; and
automatically update the cross index each time a write operation is performed that affects the cross index; and
a memory coupled with the processor, wherein the memory provides the processor with instructions.
10. A system as recited in claim 9 , wherein the cross index includes a list of objects.
11. A system as recited in claim 9 , wherein the cross index includes a plurality of lists corresponding to each of the possible values of the virtual member.
12. A system as recited in claim 9 , wherein the cross index includes a list of keys wherein each key uniquely identifies an object.
13. A system as recited in claim 9 , wherein the query function is specified in a markup language, and wherein the structure and the member are specified in a markup language.
14. A computer program product for retrieving data from a DNS database, the computer program product being embodied in a tangible non-transitory computer readable medium and comprising computer instructions for:
invoking a query function for querying the DNS database, wherein the query function specifies a plurality of structures and a value; and wherein the DNS database includes a first structure and a second structure;
accessing a cross index of the plurality of structures, wherein a first member of the first structure is concatenated with a second member of the second structure to form a third member of the cross index; and wherein the cross index indexes a structure on a member that corresponds to the value;
using the cross index to access the data; and
automatically updating the cross index each time a write operation is performed that affects the cross index.
15. A computer program product as recited in claim 14 , wherein the query function is specified in a cross index structure.
16. A computer program product as recited in claim 14 , wherein the member includes a key of a structure, wherein the key uniquely identifies an object.
17. A computer program product as recited in claim 14 , wherein the cross index includes a list of objects.
18. A computer program product as recited in claim 14 , wherein the cross index includes a plurality of lists corresponding to each of the possible values of the member.
19. A computer program product as recited in claim 14 , wherein the cross index includes a list of keys wherein each key uniquely identifies an object.
20. A computer program product as recited in claim 14 , wherein the query function is specified in a markup language, and wherein the structure and the member are specified in a markup language.