Sciweavers

6 search results - page 1 / 2
» Mapping XML to a Wide Sparse Table
Sort
View
ICDE
2012
IEEE
298views Database» more  ICDE 2012»
11 years 7 months ago
Mapping XML to a Wide Sparse Table
— XML is commonly supported by SQL database systems. However, existing mappings of XML to tables can only deliver satisfactory query performance for limited use cases. In this pa...
Liang Jeff Chen, Philip A. Bernstein, Peter Carlin...
CIDR
2007
156views Algorithms» more  CIDR 2007»
13 years 6 months ago
Column Stores for Wide and Sparse Data
While it is generally accepted that data warehouses and OLAP workloads are excellent applications for column-stores, this paper speculates that column-stores may well be suited fo...
Daniel J. Abadi
JDCTA
2010
171views more  JDCTA 2010»
12 years 12 months ago
A Complex XML Schema to Map the XML Documents of Distance Education Technical Specifications into Relational Database
To manage the complicated data such as recursive elements, multiply namespaces, repeatable structures, extended elements and attributes in the XML Binding documents of distance ed...
Xin-hua Zhu, Qing-ling Zeng, Qing-hua Cao
IWSOS
2007
Springer
13 years 11 months ago
Mercator: Self-organizing Geographic Connectivity Maps for Scalable Ad-Hoc Routing
Abstract. A fundamental problem of future networks is to get fully selforganized routing protocols with good scalability properties that produce good paths in a wide range of netwo...
Luis A. Hernando, Unai Arronategui
SBBD
2008
256views Database» more  SBBD 2008»
13 years 6 months ago
Indexing Internal Memory with Minimal Perfect Hash Functions
A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values, which are in turn used to index a hash table. Since no collisions occur, each k...
Fabiano C. Botelho, Hendrickson R. Langbehn, Guilh...