<--- Back to Details
First PageDocument Content
Computing / Data management / Data / Query languages / Bloom filter / Hashing / XPath / Bin / XQuery / Database index / XML tree / Query optimization
Date: 2013-11-27 13:39:27
Computing
Data management
Data
Query languages
Bloom filter
Hashing
XPath
Bin
XQuery
Database index
XML tree
Query optimization

A Clustered Index Approach to Distributed XPath Processing Georgia Koloniari and Evaggelia Pitoura Computer Science Department, University of Ioannina, Greece {kgeorgia,pitoura}@cs.uoi.gr

Add to Reading List

Source URL: dmod.eu

Download Document from Source Website

File Size: 88,55 KB

Share Document on Facebook

Similar Documents

MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity Martin Albrecht1 , Lorenzo Grassi3 , Christian Rechberger2,3 , Arnab Roy2 , and Tyge Tiessen2 1

MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity Martin Albrecht1 , Lorenzo Grassi3 , Christian Rechberger2,3 , Arnab Roy2 , and Tyge Tiessen2 1

DocID: 1xUN2 - View Document

Introduction to Locality-Sensitive Hashing Tyler NeylonFormats: html | pdf | kindle pdf] Locality-sensitive hashing (LSH) is a set of techniques that

Introduction to Locality-Sensitive Hashing Tyler NeylonFormats: html | pdf | kindle pdf] Locality-sensitive hashing (LSH) is a set of techniques that

DocID: 1xTR9 - View Document

Proceedings: Equality and Hashing for (Almost) Free: Generating Implementations from Abstraction Functions

Proceedings: Equality and Hashing for (Almost) Free: Generating Implementations from Abstraction Functions

DocID: 1xTdH - View Document