Sciweavers

813 search results - page 47 / 163
» Efficient Processing of Updates in Dynamic XML Data
Sort
View
ICPR
2008
IEEE
14 years 10 months ago
A discrete-time parallel update algorithm for distributed learning
We present a distributed machine learning framework based on support vector machines that allows classification problems to be solved iteratively through parallel update algorithm...
Christian Bauckhage, Tansu Alpcan
DASFAA
2007
IEEE
135views Database» more  DASFAA 2007»
14 years 3 months ago
A Development of Hash-Lookup Trees to Support Querying Streaming XML
Abstract. The rapid growth in the amount of XML data and the development of publish-subscribe systems have led to great interest in processing streaming XML data. We propose the Qs...
James Cheng, Wilfred Ng
SIGMOD
2007
ACM
134views Database» more  SIGMOD 2007»
14 years 9 months ago
Updating a cracked database
A cracked database is a datastore continuously reorganized based on operations being executed. For each query, the data of interest is physically reclustered to speed-up future ac...
Stratos Idreos, Martin L. Kersten, Stefan Manegold
DATESO
2008
131views Database» more  DATESO 2008»
13 years 10 months ago
Towards Cost-based Optimizations of Twig Content-based Queries
Abstract In recent years, many approaches to indexing XML data have appeared. These approaches attempt to process XML queries efficiently and sufficient query plans are built for t...
Michal Krátký, Radim Baca
AINA
2009
IEEE
14 years 4 months ago
A Fast and Memory Efficient Dynamic IP Lookup Algorithm Based on B-Tree
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
Yeim-Kuan Chang, Yung-Chieh Lin