diff --git a/consul/prepared_query/template.go b/consul/prepared_query/template.go
new file mode 100644
index 0000000000..d175db5c75
--- /dev/null
+++ b/consul/prepared_query/template.go
@@ -0,0 +1,214 @@
+package prepared_query
+
+import (
+	"fmt"
+	"reflect"
+	"regexp"
+	"strings"
+
+	"github.com/hashicorp/consul/consul/structs"
+	"github.com/hashicorp/hil"
+	"github.com/hashicorp/hil/ast"
+	"github.com/mitchellh/copystructure"
+)
+
+// IsTemplate returns true if the given query is a template.
+func IsTemplate(query *structs.PreparedQuery) bool {
+	return query.Template.Type != ""
+}
+
+// CompiledTemplate is an opaque object that can be used later to render a
+// prepared query template.
+type CompiledTemplate struct {
+	// query keeps a copy of the original query for rendering.
+	query *structs.PreparedQuery
+
+	// trees contains a map with paths to string fields in a structure to
+	// parsed syntax trees, suitable for later evaluation.
+	trees map[string]ast.Node
+
+	// re is the compiled regexp, if they supplied one (this can be nil).
+	re *regexp.Regexp
+}
+
+// Render takes a compiled template and renders it for the given name. For
+// example, if the user looks up foobar.query.consul via DNS then we will call
+// this function with "foobar" on the compiled template.
+func (ct *CompiledTemplate) Render(name string) (*structs.PreparedQuery, error) {
+	// Start with a fresh, detached copy of the original so we don't disturb
+	// the prototype.
+	dup, err := copystructure.Copy(ct.query)
+	if err != nil {
+		return nil, err
+	}
+	query, ok := dup.(*structs.PreparedQuery)
+	if !ok {
+		return nil, fmt.Errorf("Failed to copy query")
+	}
+
+	// Run the regular expression, if provided. We execute on a copy here
+	// to avoid internal lock contention because we expect this to be called
+	// from multiple goroutines.
+	var matches []string
+	if ct.re != nil {
+		matches = ct.re.Copy().FindStringSubmatch(name)
+	}
+
+	// Create a safe match function that can't fail at run time. It will
+	// return an empty string for any invalid input.
+	match := ast.Function{
+		ArgTypes:   []ast.Type{ast.TypeInt},
+		ReturnType: ast.TypeString,
+		Variadic:   false,
+		Callback: func(inputs []interface{}) (interface{}, error) {
+			i, ok := inputs[0].(int)
+			if ok && i < len(matches) {
+				return matches[i], nil
+			} else {
+				return "", nil
+			}
+		},
+	}
+
+	// Build up the HIL evaluation context.
+	config := &hil.EvalConfig{
+		GlobalScope: &ast.BasicScope{
+			VarMap: map[string]ast.Variable{
+				"name.full": ast.Variable{
+					Type:  ast.TypeString,
+					Value: name,
+				},
+				"name.prefix": ast.Variable{
+					Type:  ast.TypeString,
+					Value: query.Name,
+				},
+				"name.suffix": ast.Variable{
+					Type:  ast.TypeString,
+					Value: strings.TrimPrefix(name, query.Name),
+				},
+			},
+			FuncMap: map[string]ast.Function{
+				"match": match,
+			},
+		},
+	}
+
+	// Run through the Service sub-structure and evaluate all the strings
+	// as HIL.
+	eval := func(path string, v reflect.Value) error {
+		tree, ok := ct.trees[path]
+		if !ok {
+			return nil
+		}
+
+		hv, ht, err := hil.Eval(tree, config)
+		if err != nil {
+			return err
+		}
+		if ht != ast.TypeString {
+			return fmt.Errorf("Expected Service%s filed to be a string, got %s", path, ht)
+		}
+
+		v.SetString(hv.(string))
+		return nil
+	}
+	if err := walk(&query.Service, eval); err != nil {
+		return nil, err
+	}
+
+	return query, nil
+}
+
+// Compile validates a prepared query template and returns an opaque compiled
+// object that can be used later to render the template.
+func Compile(query *structs.PreparedQuery) (*CompiledTemplate, error) {
+	// Make sure it's a type we understand.
+	if query.Template.Type != structs.QueryTemplateTypeNamePrefixMatch {
+		return nil, fmt.Errorf("Bad Template.Type '%s'", query.Template.Type)
+	}
+
+	// Start compile.
+	ct := &CompiledTemplate{
+		trees: make(map[string]ast.Node),
+	}
+
+	// Make a copy of the query to use as the basis for rendering later.
+	dup, err := copystructure.Copy(query)
+	if err != nil {
+		return nil, err
+	}
+	var ok bool
+	ct.query, ok = dup.(*structs.PreparedQuery)
+	if !ok {
+		return nil, fmt.Errorf("Failed to copy query")
+	}
+
+	// Walk over all the string fields in the Service sub-structure and
+	// parse them as HIL.
+	parse := func(path string, v reflect.Value) error {
+		tree, err := hil.Parse(v.String())
+		if err != nil {
+			return fmt.Errorf("Bad Service%s field with contents '%s': %s", path, v.String(), err)
+		}
+
+		ct.trees[path] = tree
+		return nil
+	}
+	if err := walk(&ct.query.Service, parse); err != nil {
+		return nil, err
+	}
+
+	// If they supplied a regexp then compile it.
+	if ct.query.Template.Regexp != "" {
+		var err error
+		ct.re, err = regexp.Compile(ct.query.Template.Regexp)
+		if err != nil {
+			return nil, fmt.Errorf("Bad Regexp: %s", err)
+		}
+	}
+
+	return ct, nil
+}
+
+// visitor is a function that will get called for each string element of a
+// structure.
+type visitor func(path string, v reflect.Value) error
+
+// visit calls the visitor function for each string it finds, and will descend
+// recursively into structures and slices. If any visitor returns an error then
+// the search will stop and that error will be returned.
+func visit(path string, v reflect.Value, t reflect.Type, fn visitor) error {
+	switch v.Kind() {
+	case reflect.String:
+		return fn(path, v)
+	case reflect.Struct:
+		for i := 0; i < v.NumField(); i++ {
+			vf := v.Field(i)
+			tf := t.Field(i)
+			newPath := fmt.Sprintf("%s.%s", path, tf.Name)
+			if err := visit(newPath, vf, tf.Type, fn); err != nil {
+				return err
+			}
+		}
+	case reflect.Slice:
+		for i := 0; i < v.Len(); i++ {
+			vi := v.Index(i)
+			ti := vi.Type()
+			newPath := fmt.Sprintf("%s[%d]", path, i)
+			if err := visit(newPath, vi, ti, fn); err != nil {
+				return err
+			}
+		}
+	}
+	return nil
+}
+
+// walk finds all the string elements of a given structure (and its sub-
+// structures) and calls the visitor function. Each string found will get
+// a unique path computed. If any visitor returns an error then the search
+// will stop and that error will be returned.
+func walk(obj interface{}, fn visitor) error {
+	v := reflect.ValueOf(obj).Elem()
+	t := v.Type()
+	return visit("", v, t, fn)
+}
diff --git a/consul/prepared_query/template_test.go b/consul/prepared_query/template_test.go
new file mode 100644
index 0000000000..7060f7c736
--- /dev/null
+++ b/consul/prepared_query/template_test.go
@@ -0,0 +1,72 @@
+package prepared_query
+
+import (
+	"fmt"
+	"testing"
+
+	"github.com/hashicorp/consul/consul/structs"
+)
+
+var (
+	bench = &structs.PreparedQuery{
+		Name: "hello",
+		Template: structs.QueryTemplateOptions{
+			Type:   structs.QueryTemplateTypeNamePrefixMatch,
+			Regexp: "^hello-(.*)-(.*)$",
+		},
+		Service: structs.ServiceQuery{
+			Service: "${name.full}",
+			Tags:    []string{"${name.prefix}", "${name.suffix}", "${match(0)}", "${match(1)}", "${match(2)}"},
+		},
+	}
+)
+
+func BenchmarkTemplate_Compile(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		_, err := Compile(bench)
+		if err != nil {
+			b.Fatalf("err: %v", err)
+		}
+	}
+}
+
+func BenchmarkTemplate_Render(b *testing.B) {
+	compiled, err := Compile(bench)
+	if err != nil {
+		b.Fatalf("err: %v", err)
+	}
+
+	for i := 0; i < b.N; i++ {
+		_, err := compiled.Render("hello-bench-mark")
+		if err != nil {
+			b.Fatalf("err: %v", err)
+		}
+	}
+}
+
+func TestTemplate_Compile(t *testing.T) {
+	query := &structs.PreparedQuery{
+		Name: "hello",
+		Template: structs.QueryTemplateOptions{
+			Type:   structs.QueryTemplateTypeNamePrefixMatch,
+			Regexp: "^hello-(.*)$",
+		},
+		Service: structs.ServiceQuery{
+			Service: "${name.full}",
+			Tags:    []string{"${name.prefix}", "${name.suffix}", "${match(0)}", "${match(1)}", "${match(2)}"},
+		},
+	}
+
+	compiled, err := Compile(query)
+	if err != nil {
+		t.Fatalf("err: %v", err)
+	}
+
+	rendered, err := compiled.Render("hello-everyone")
+	if err != nil {
+		t.Fatalf("err: %v", err)
+	}
+
+	fmt.Printf("%#v\n", *query)
+	fmt.Printf("%#v\n", *rendered)
+}