Back to Results
First PageMeta Content
Formal languages / Computer science / Applied mathematics / Pattern matching / Regular expressions / Nondeterministic finite automaton / Deterministic finite automaton / Nested word / Finite-state machine / Automata theory / Models of computation / Theoretical computer science


Optimization of Massive Pattern Queries by Dynamic Configuration Morphing Nikolay Laptev #1 , Carlo Zaniolo #2 # University of California, Los Angeles
Add to Reading List

Document Date: 2015-02-04 18:38:47


Open Document

File Size: 768,59 KB

Share Result on Facebook

Company

optimization LP / Engine Output (matches) 3 Available Resources / New Automaton LP / /

/

Event

Reorganization / /

Facility

University of California / /

IndustryTerm

found solution / automated statistics collection tool / search process / split/merge approximation algorithms / adaptive query processing / software logs / query generator tool / feasible solution / online environment / binary search / query generation tool / hyper-threading server / online process / data mining / multi-core systems / deficient solution / real-time response requirement / online traffic / high processing availability / monitoring tools / network management / integer solution / near optimal solutions / above solution / pre-configuration algorithm / pre-computing / search space / pre-computing templates / applicable solution / average search / low processing availability / /

MarketIndex

XML / /

OperatingSystem

Linux / /

Organization

MIT / FSA / University of California / Los Angeles / /

Person

Carlo Zaniolo / Lincoln Lab / Nikolay Laptev / /

/

Position

straight forward / /

Product

Burn In Test utility / Morpheus / Burn / /

ProgrammingLanguage

SQL / XML / Java / K / /

Technology

genomics / XML / RAM / split/merge approximation algorithms / Java / finite state machine / Linux / HTTP / data mining / SSP algorithm / pre-configuration algorithm / /

SocialTag