diff --git a/nsqlookupd/registration_db.go b/nsqlookupd/registration_db.go
index 86bb6df63..d5a4825b3 100644
--- a/nsqlookupd/registration_db.go
+++ b/nsqlookupd/registration_db.go
@@ -9,7 +9,8 @@ import (
 
 type RegistrationDB struct {
 	sync.RWMutex
-	registrationMap map[Registration]ProducerMap
+	registrationMap        map[Registration]ProducerMap
+	highSpeedRegistrations map[Registration]Registrations
 }
 
 type Registration struct {
@@ -55,7 +56,32 @@ func (p *Producer) IsTombstoned(lifetime time.Duration) bool {
 
 func NewRegistrationDB() *RegistrationDB {
 	return &RegistrationDB{
-		registrationMap: make(map[Registration]ProducerMap),
+		registrationMap:        make(map[Registration]ProducerMap),
+		highSpeedRegistrations: make(map[Registration]Registrations),
+	}
+}
+
+// update high speed registrations map
+// should call this func when registrationMap updated
+func (r *RegistrationDB) fillHighSpeedRegistrations() {
+	r.highSpeedRegistrations = make(map[Registration]Registrations)
+	for k := range r.registrationMap {
+		key := Registration{k.Category, "*", ""}
+		if _, ok := r.highSpeedRegistrations[key]; !ok {
+			r.highSpeedRegistrations[key] = Registrations{}
+		}
+		if k.IsMatch(key.Category, key.Key, key.SubKey) {
+			r.highSpeedRegistrations[key] = append(r.highSpeedRegistrations[key], k)
+		}
+		if k.SubKey != "" {
+			subKey := Registration{k.Category, k.Key, "*"}
+			if _, ok := r.highSpeedRegistrations[subKey]; !ok {
+				r.highSpeedRegistrations[subKey] = Registrations{}
+			}
+			if k.IsMatch(subKey.Category, subKey.Key, subKey.SubKey) {
+				r.highSpeedRegistrations[subKey] = append(r.highSpeedRegistrations[subKey], k)
+			}
+		}
 	}
 }
 
@@ -66,6 +92,7 @@ func (r *RegistrationDB) AddRegistration(k Registration) {
 	_, ok := r.registrationMap[k]
 	if !ok {
 		r.registrationMap[k] = make(map[string]*Producer)
+		r.fillHighSpeedRegistrations()
 	}
 }
 
@@ -76,6 +103,7 @@ func (r *RegistrationDB) AddProducer(k Registration, p *Producer) bool {
 	_, ok := r.registrationMap[k]
 	if !ok {
 		r.registrationMap[k] = make(map[string]*Producer)
+		r.fillHighSpeedRegistrations()
 	}
 	producers := r.registrationMap[k]
 	_, found := producers[p.peerInfo.id]
@@ -124,6 +152,7 @@ func (r *RegistrationDB) RemoveRegistration(k Registration) {
 	r.Lock()
 	defer r.Unlock()
 	delete(r.registrationMap, k)
+	r.fillHighSpeedRegistrations()
 }
 
 func (r *RegistrationDB) needFilter(key string, subkey string) bool {
@@ -140,6 +169,10 @@ func (r *RegistrationDB) FindRegistrations(category string, key string, subkey s
 		}
 		return Registrations{}
 	}
+	quickKey := Registration{category, key, subkey}
+	if quickResults, ok := r.highSpeedRegistrations[quickKey]; ok {
+		return quickResults
+	}
 	results := Registrations{}
 	for k := range r.registrationMap {
 		if !k.IsMatch(category, key, subkey) {
diff --git a/nsqlookupd/registration_db_test.go b/nsqlookupd/registration_db_test.go
index ba67b96da..e1b4ea964 100644
--- a/nsqlookupd/registration_db_test.go
+++ b/nsqlookupd/registration_db_test.go
@@ -338,9 +338,9 @@ func BenchmarkLookupChannels64x64x64(b *testing.B) {
 	benchmarkLookupChannels(b, 64, 64, 64)
 }
 
-func BenchmarkLookupChannels64x512x512(b *testing.B) {
-	benchmarkLookupChannels(b, 64, 512, 512)
-}
+//func BenchmarkLookupChannels64x512x512(b *testing.B) {
+//	benchmarkLookupChannels(b, 64, 512, 512)
+//}
 
 //func BenchmarkLookupChannels512x512x512(b *testing.B) {
 //	benchmarkLookupChannels(b, 512, 512, 512)