Sciweavers

74 search results - page 7 / 15
» Dual-Sorted Inverted Lists
Sort
View
ICDE
2012
IEEE
208views Database» more  ICDE 2012»
13 years 4 months ago
Fast SLCA and ELCA Computation for XML Keyword Queries Based on Set Intersection
— In this paper, we focus on efficient keyword query processing for XML data based on SLCA and ELCA semantics. We propose for each keyword a novel form of inverted list, which i...
Junfeng Zhou, Zhifeng Bao, Wei Wang, Tok Wang Ling...
STACS
2009
Springer
15 years 8 months ago
Compressed Representations of Permutations, and Applications
We explore various techniques to compress a permutation π over n integers, taking advantage of ordered subsequences in π, while supporting its application π(i) and the applicat...
Jérémy Barbay, Gonzalo Navarro
DATESO
2009
146views Database» more  DATESO 2009»
14 years 11 months ago
Compression of the Stream Array Data Structure
In recent years, many approaches to XML twig pattern query (TPQ) processing have been developed. Some algorithms are supported by a stream abstract data type. s an abstract data ty...
Radim Baca, Martin Pawlas
SIGIR
2011
ACM
14 years 4 months ago
Faster top-k document retrieval using block-max indexes
Large search engines process thousands of queries per second over billions of documents, making query processing a major performance bottleneck. An important class of optimization...
Shuai Ding, Torsten Suel
80
Voted
UIST
2006
ACM
15 years 7 months ago
Under the table interaction
We explore the design space of a two-sided interactive touch table, designed to receive touch input from both the top and bottom surfaces of the table. By combining two registered...
Daniel Wigdor, Darren Leigh, Clifton Forlines, Sam...