Sciweavers

959 search results - page 154 / 192
» Possible and Necessary h-Indices
Sort
View
SIGMOD
2009
ACM
168views Database» more  SIGMOD 2009»
14 years 7 months ago
Database research in computer games
This tutorial presents an overview of the data management issues faced by computer games today. While many games do not use databases directly, they still have to process large am...
Alan J. Demers, Johannes Gehrke, Christoph Koch, B...
SIGMOD
2005
ACM
154views Database» more  SIGMOD 2005»
14 years 7 months ago
Lazy XML Updates: Laziness as a Virtue of Update and Structural Join Efficiency
XML documents are normally stored as plain text files. Hence, the natural and most convenient way to update XML documents is to simply edit the text files. But efficient query eva...
Barbara Catania, Wen Qiang Wang, Beng Chin Ooi, Xi...
SIGMOD
2004
ACM
149views Database» more  SIGMOD 2004»
14 years 7 months ago
Incremental Maintenance of XML Structural Indexes
Increasing popularity of XML in recent years has generated much interest in query processing over graph-structured data. To support efficient evaluation of path expressions, many ...
Ke Yi, Hao He, Ioana Stanoi, Jun Yang 0001
ICFP
2005
ACM
14 years 7 months ago
Toward a general theory of names: binding and scope
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
James Cheney
ICCD
2006
IEEE
86views Hardware» more  ICCD 2006»
14 years 4 months ago
Interconnect Matching Design Rule Inferring and Optimization through Correlation Extraction
— New back-end design for manufacturability rules have brought guarantee rules for interconnect matching. These rules indicate a certain capacitance matching guarantee given spac...
Rasit Onur Topaloglu, Andrew B. Kahng