Sciweavers

8 search results - page 1 / 2
» Compressing and searching XML data via two zips
Sort
View
WWW
2006
ACM
14 years 5 months ago
Compressing and searching XML data via two zips
XML is fast becoming the standard format to store, exchange and publish over the web, and is getting embedded in applications. Two challenges in handling XML are its size (the XML...
Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini...
MASCOTS
2003
13 years 6 months ago
NAM: A Network Adaptable Middleware to Enhance Response Time of Web Services
Web Services are an emerging software technology that employ XML to share and exchange data. They may serve as wrappers for legacy data sources, integrate multiple remote data sou...
Shahram Ghandeharizadeh, Christos Papadopoulos, Pa...
VLDB
2008
ACM
170views Database» more  VLDB 2008»
14 years 4 months ago
A multi-ranker model for adaptive XML searching
The evolution of computing technology suggests that it has become more feasible to offer access to Web information in a ubiquitous way, through various kinds of interaction device...
Ho Lam Lau, Wilfred Ng
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
14 years 4 months ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...
TIT
2008
107views more  TIT 2008»
13 years 4 months ago
Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers
The term binary combinatorial Gray code refers to a list of binary words such that the Hamming distance between two neighboring words is one and the list satisfies some additional ...
Igor Zinovik, Daniel Kroening, Yury Chebiryak