Sciweavers

327 search results - page 62 / 66
» XML Tree Structure Compression
Sort
View
SIGMOD
2009
ACM
182views Database» more  SIGMOD 2009»
14 years 8 months ago
3-HOP: a high-compression indexing scheme for reachability query
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
Ruoming Jin, Yang Xiang, Ning Ruan, David Fuhry
SIGMOD
2000
ACM
129views Database» more  SIGMOD 2000»
14 years 3 days ago
Mining Frequent Patterns without Candidate Generation
Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous...
Jiawei Han, Jian Pei, Yiwen Yin
MFCS
2009
Springer
14 years 2 months ago
Query Automata for Nested Words
We study visibly pushdown automata (VPA) models for expressing and evaluating queries, expressed using MSO formulas, on words with a nesting structure (like XML documents). We deļ...
P. Madhusudan, Mahesh Viswanathan
DOCENG
2006
ACM
14 years 1 months ago
Evaluating invariances in document layout functions
With the development of variable-data-driven digital presses where each document printed is potentially unique there is a need for pre-press optimization to identify material that...
Alexander J. Macdonald, David F. Brailsford, John ...
DOCENG
2007
ACM
13 years 11 months ago
Speculative document evaluation
Optimisation of real world Variable Data printing (VDP) documents is a difficult problem because the interdependencies between layout functions may drastically reduce the number o...
Alexander J. Macdonald, David F. Brailsford, Steve...