diff --git a/fragment.go b/fragment.go
index 835c1abe8..697f11f92 100644
--- a/fragment.go
+++ b/fragment.go
@@ -153,7 +153,6 @@ func (f *fragment) Open() error {
 		pos := f.storage.Max()
 		f.maxRowID = pos / ShardWidth
 		f.stats.Gauge("rows", float64(f.maxRowID), 1.0)
-
 		return nil
 	}(); err != nil {
 		f.close()
@@ -1680,6 +1679,62 @@ func (f *fragment) readCacheFromArchive(r io.Reader) error {
 	return nil
 }
 
+func (f *fragment) rows() []uint64 {
+	i, _ := f.storage.Containers.Iterator(0)
+	rows := make([]uint64, 0)
+
+	var lastRow uint64
+	lastRow = math.MaxUint64
+
+	// Loop over the existing containers.
+	for i.Next() {
+		key, _ := i.Value()
+
+		// virtual row for the current container
+		vRow := key >> 4
+
+		// skip dups
+		if vRow == lastRow {
+			continue
+		}
+
+		rows = append(rows, vRow)
+		lastRow = vRow
+	}
+	return rows
+
+}
+
+func (f *fragment) rowsForColumn(columnID uint64) []uint64 {
+	colID := columnID % ShardWidth
+	i, _ := f.storage.Containers.Iterator(0)
+
+	colKey := uint64(0)
+	colVal := uint16(colID & 0xFFFF)
+
+	rows := make([]uint64, 0)
+
+	// Loop over the existing containers.
+	for i.Next() {
+		key, c := i.Value()
+
+		// virtual row for the current container
+		vRow := key >> 4
+
+		// column container key for virtual row
+		colKey = ((vRow * ShardWidth) + colID) >> 16
+
+		if colKey != key {
+			continue
+		}
+
+		if c.Contains(colVal) {
+			rows = append(rows, vRow)
+		}
+	}
+	return rows
+}
+
 // FragmentBlock represents info about a subsection of the rows in a block.
 // This is used for comparing data in remote blocks for active anti-entropy.
 type FragmentBlock struct {
diff --git a/fragment_internal_test.go b/fragment_internal_test.go
index e665a10ba..f487ba40c 100644
--- a/fragment_internal_test.go
+++ b/fragment_internal_test.go
@@ -1278,3 +1278,31 @@ func (f *fragment) mustSetBits(rowID uint64, columnIDs ...uint64) {
 		}
 	}
 }
+
+// Test Various methods of retrieving RowIDs
+func TestFragment_RowsIteration(t *testing.T) {
+	f := mustOpenFragment("i", "f", viewStandard, 0, "")
+	defer f.Close()
+	expected1 := make([]uint64, 0)
+	expected2 := make([]uint64, 0)
+	for i := uint64(100); i < uint64(200); i++ {
+		if _, err := f.setBit(i, i%2); err != nil {
+			t.Fatal(err)
+		}
+		expected1 = append(expected1, i)
+		if i%2 == 1 {
+			expected2 = append(expected2, i)
+		}
+	}
+
+	ids := f.rows()
+	if !reflect.DeepEqual(expected1, ids) {
+		t.Fatalf("Do not match %v %v", expected1, ids)
+
+	}
+
+	ids = f.rowsForColumn(1)
+	if !reflect.DeepEqual(expected2, ids) {
+		t.Fatalf("Do not match %v %v", expected2, ids)
+	}
+}
diff --git a/roaring/roaring.go b/roaring/roaring.go
index 3756d1db7..3a0418aa3 100644
--- a/roaring/roaring.go
+++ b/roaring/roaring.go
@@ -177,7 +177,7 @@ func (b *Bitmap) Contains(v uint64) bool {
 	if c == nil {
 		return false
 	}
-	return c.contains(lowbits(v))
+	return c.Contains(lowbits(v))
 }
 
 // Remove removes values from the bitmap.
@@ -1272,8 +1272,8 @@ func (c *Container) runAdd(v uint16) bool {
 	return true
 }
 
-// contains returns true if v is in the container.
-func (c *Container) contains(v uint16) bool {
+// Contains returns true if v is in the container.
+func (c *Container) Contains(v uint16) bool {
 	if c.isArray() {
 		return c.arrayContains(v)
 	} else if c.isRun() {